Table of Contents

• Introduction: If CiE Did Not Exist, It Would Be Necessary to Invent ItS. Barry Cooper. 1-7 [doi]
• Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table DegreesGeorge Barmpalias. 8-17 [doi]
• The Fan Theorem and Uniform ContinuityJosef Berger. 18-22 [doi]
• Continuous Semantics for Strong NormalizationUlrich Berger. 23-34 [doi]
• A Thread Algebra with Multi-level Strategic InterleavingJan A. Bergstra, C. A. Middelburg. 35-48 [doi]
• Membrane Computing - Current Results and Future ProblemsFrancesco Bernardini, Marian Gheorghe, Natalio Krasnogor, Germán Terrazas. 49-53 [doi]
• How to Compare the Power of Computational ModelsUdi Boker, Nachum Dershowitz. 54-64 [doi]
• Recombinant DNA , Gene Splicing as Generative Devices of Formal LanguagesPaola Bonizzoni, Clelia de Felice, Giancarlo Mauri. 65-67 [doi]
• Quantum ComputingHarry Buhrman. 68-68 [doi]
• Symbol Grounding in Connectionist and Adaptive Agent ModelsAngelo Cangelosi. 69-74 [doi]
• The Complexity of Inductive DefinabilityDouglas A. Cenzer, Jeffrey B. Remmel. 75-85 [doi]
• A Logical Approach to Abstract AlgebraThierry Coquand. 86-95 [doi]
• Schnorr DimensionRodney G. Downey, Wolfgang Merkle, Jan Reimann. 96-105 [doi]
• Abstract Geometrical Computation: Turing-Computing Ability and UndecidabilityJérôme Durand-Lose. 106-116 [doi]
• Computability in Computational GeometryAbbas Edalat, Ali Asghar Khanban, André Lieutier. 117-127 [doi]
• Shrad: A Language for Sequential Real Number ComputationAmin Farjudian. 128-128 [doi]
• Borel Ranks and Wadge Degrees of Context Free omega-LanguagesOlivier Finkel. 129-138 [doi]
• Fewer Epistemological Challenges for ConnectionismArtur S. d Avila Garcez. 139-149 [doi]
• An Algebraic View on Exact Learning from QueriesRicard Gavaldà. 150-151 [doi]
• The Church-Turing Thesis: Breaking the MythDina Q. Goldin, Peter Wegner. 152-168 [doi]
• Robust Simulations of Turing Machines with Analytic Maps and FlowsDaniel S. Graça, Manuel Lameiras Campagnolo, Jorge Buescu. 169-179 [doi]
• Infinitary Computability with Infinite Time Turing MachinesJoel David Hamkins. 180-187 [doi]
• Combinatorial Models of Gene AssemblyTero Harju. 188-195 [doi]
• Symmetric Enumeration ReducibilityCharles M. Harris. 196-208 [doi]
• Computability-Theoretic and Proof-Theoretic Aspects of Vaughtian Model TheoryDenis R. Hirschfeldt. 209-210 [doi]
• Finite Trees as OrdinalsHerman Ruge Jervell. 211-220 [doi]
• On the Problems of Definability in the Enumeration DegreesIskander Sh. Kalimullin. 221-222 [doi]
• Computing a Model of Set TheoryPeter Koepke. 223-232 [doi]
• Proof Mining in Functional AnalysisUlrich Kohlenbach. 233-234 [doi]
• Towards Computability of Higher Type Continuous DataMargarita V. Korovina, Oleg V. Kudinov. 235-241 [doi]
• The Power of Mobility: Four Membranes SufficeShankara Narayanan Krishna. 242-251 [doi]
• The Small Grzegorczyk Classes and the Typed lambda-CalculusLars Kristiansen, Mathias Barra. 252-262 [doi]
• The Flow of Data and the Complexity of AlgorithmsLars Kristiansen, Neil D. Jones. 263-274 [doi]
• On a Question of Sacks - A Partial Solution on the Positive SideAndrew E. M. Lewis. 275-286 [doi]
• The Low Splitting Theorem in the Difference HierarchyAngsheng Li. 287-296 [doi]
• Geometric Software: Robustness Issues and Model of ComputationAndré Lieutier. 297-298 [doi]
• The Dimension of a Point: Computability Meets Fractal GeometryJack H. Lutz. 299-299 [doi]
• Accepting Networks of Splicing ProcessorsFlorin Manea, Carlos Martín-Vide, Victor Mitrana. 300-309 [doi]
• Hilbert s Tenth Problem and Paradigms of ComputationYuri Matiyasevich. 310-321 [doi]
• On Some Relations Between Approximation Problems and PCPs over the Real NumbersKlaus Meer. 322-331 [doi]
• Correlation Dimension and the Quality of Forecasts Given by a Neural NetworkKrzysztof Michalak, Halina Kwasnicka. 332-341 [doi]
• The Computational Complexity of One-Dimensional SandpilesPeter Bro Miltersen. 342-348 [doi]
• Categoricity in Restricted ClassesAndrey Morozov. 349-349 [doi]
• Recursion and ComplexityYiannis N. Moschovakis. 350-357 [doi]
• FM-Representability and BeyondMarcin Mostowski, Konrad Zdanowski. 358-367 [doi]
• Formalising Exact Arithmetic in Type TheoryMilad Niqui. 368-377 [doi]
• Complexity in Predicative ArithmeticGeoffrey E. Ostrin, Stanley S. Wainer. 378-384 [doi]
• Domain-Theoretic Formulation of Linear Boundary Value ProblemsDirk Pattinson. 385-395 [doi]
• Membrane Computing: Power, Efficiency, ApplicationsGheorghe Paun. 396-407 [doi]
• The Analogue of Büchi s Problem for PolynomialsThanases Pheidas, Xavier Vidaux. 408-417 [doi]
• On the Turing Degrees of Divergence Bounded Computable RealsRobert Rettinger, Xizhong Zheng. 418-428 [doi]
• New Algorithmic Paradigms in Exponential Time AlgorithmsUwe Schöning. 429-429 [doi]
• Some Reducibilities on Regular SetsVictor L. Selivanov. 430-439 [doi]
• Computability and Discrete Dynamical SystemsWilfried Sieg. 440-440 [doi]
• Uniform OperatorsIvan N. Soskov. 441-450 [doi]
• Minimal Pairs and Quasi-minimal Degrees for the Joint Spectra of StructuresAlexandra A. Soskova. 451-460 [doi]
• Presentations of K-Trivial Reals and Kolmogorov ComplexityFrank Stephan, Guohua Wu. 461-469 [doi]
• Presentations of Structures in Admissible SetsAlexey Stukachev. 470-478 [doi]
• An Environment Aware P-System Model of Quorum SensingGermán Terrazas, Natalio Krasnogor, Marian Gheorghe, Francesco Bernardini, Steve Diggle, Miguel Cámara. 479-485 [doi]
• Kripke Models, Distributive Lattices, and Medvedev DegreesSebastiaan Terwijn. 486-494 [doi]
• Arthur-Merlin Games and the Problem of Isomorphism TestingJacobo Torán. 495-506 [doi]
• Beyond the Super-Turing Snare: Analog Computation and Digital VirtualityGiuseppe Trautteur. 507-514 [doi]
• A Network Model of Analogue Computation over Metric AlgebrasJ. V. Tucker, Jeffery I. Zucker. 515-529 [doi]
• Computable AnalysisKlaus Weihrauch. 530-531 [doi]
• The Transfinite Action of 1 Tape Turing MachinesPhilip D. Welch. 532-539 [doi]
• Complexity of Continuous Space Machine OperationsDamien Woods, J. Paul Gibson. 540-551 [doi]
• Computable Analysis of a Non-homogeneous Boundary-Value Problem for the Korteweg-de Vries EquationNing Zhong. 552-561 [doi]
• Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 NondeterminismMartin Ziegler. 562-571 [doi]