Table of Contents

• Shifting and Lifting of Cellular AutomataLuigi Acerbi, Alberto Dennunzio, Enrico Formenti. 1-10 [doi]
• Learning as Data CompressionPieter W. Adriaans. 11-24 [doi]
• Reachability Problems: An UpdateEric Allender. 25-27 [doi]
• RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming PracticeAndrej Bauer, Christopher A. Stone. 28-42 [doi]
• Producer/Consumer in Membrane Systems and Petri NetsFrancesco Bernardini, Marian Gheorghe, Maurice Margenstern, Sergey Verlan. 43-52 [doi]
• A Minimal Pair in the Quotient Structure ::::M:::: / ::::NCup::::Rongfang Bie, Guohua Wu. 53-62 [doi]
• Constructive Dimension and Weak Truth-Table DegreesLaurent Bienvenu, David Doty, Frank Stephan. 63-72 [doi]
• A Classification of Viruses Through Recursion TheoremsGuillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion. 73-82 [doi]
• Borel Complexity of Topological Operations on Computable Metric SpacesVasco Brattka, Guido Gherardi. 83-97 [doi]
• Colocatedness and Lebesgue IntegrabilityDouglas S. Bridges. 98-104 [doi]
• Computing with Genetic GatesNadia Busi, Claudio Zandron. 105-114 [doi]
• Resource Restricted Computability Theoretic Learning: Illustrative Topics and ProblemsJohn Case. 115-124 [doi]
• Characterizing Programming Systems Allowing Program Self-referenceJohn Case, Samuel E. Moelius. 125-134 [doi]
• ::::K:::: -Trivial Closed Sets and Continuous FunctionsGeorge Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber. 135-145 [doi]
• Pseudojump Operators and P:::0:::::1:: ClassesDouglas A. Cenzer, Geoffrey LaForte, Guohua Wu. 146-151 [doi]
• Sofic Trace Subshift of a Cellular AutomatonJulien Cervelle, Enrico Formenti, Pierre Guillon. 152-161 [doi]
• Thin Maximal Antichains in the Turing DegreesChi Tat Chong, Liang Yu. 162-168 [doi]
• Effective Computation for Nonlinear SystemsPieter Collins. 169-178 [doi]
• On Rules and Parameter Free Systems in Bounded ArithmeticAndrés Cordón-Franco, Alejandro Fernández-Margarit, Francisco Félix Lara Martín. 179-188 [doi]
• The New Promise of Analog ComputationJosé Félix Costa, Bruno Loff, Jerzy Mycka. 189-195 [doi]
• Comparing C.E. Sets Based on Their Settling TimesBarbara F. Csima. 196-204 [doi]
• Time-Complexity Semantics for Feasible Affine RecursionsNorman Danner, James S. Royer. 205-217 [doi]
• Algebraic Model of an Arithmetic Unit for TTE-Computable Normalized Rational NumbersGregorio de Miguel Casado, Juan Manuel García Chamizo, Maria Teresa Signes Pont. 218-227 [doi]
• Feasible DepthDavid Doty, Philippe Moser. 228-237 [doi]
• Abstract Geometrical Computation and the Linear Blum, Shub and Smale ModelJérôme Durand-Lose. 238-247 [doi]
• A Continuous Derivative for Real-Valued FunctionsAbbas Edalat. 248-257 [doi]
• Refocusing Generalised NormalisationJosé Espírito Santo. 258-267 [doi]
• The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf NumberMichael R. Fellows, Frances A. Rosamond. 268-277 [doi]
• Parameterized Complexity and LogicJörg Flum. 278-289 [doi]
• Index Sets of Computable Structures with Decidable TheoriesEkaterina B. Fokina. 290-296 [doi]
• Minimal Representations for Majority GamesJosep Freixas, Xavier Molinero, Salvador Roura. 297-306 [doi]
• Linear Transformations in Boolean Complexity TheoryJoel Friedman. 307-315 [doi]
• Exact Pair Theorem for the ::::omega:::: -Enumeration DegreesHristo Ganchev. 316-324 [doi]
• Operational Semantics for Positive Relevant Logics Without DistributionYing Gao, Jingde Cheng. 325-335 [doi]
• Multi-valued Logics, Effectiveness and DomainsGiangiacomo Gerla. 336-347 [doi]
• Internal ComputabilityGuido Gherardi. 348-357 [doi]
• Post s Problem for Ordinal Register MachinesJoel David Hamkins, Russell G. Miller. 358-367 [doi]
• Unique Existence and Computability in Constructive Reverse MathematicsHajime Ishihara. 368-377 [doi]
• Input-Dependence in Function-LearningSanjay Jain, Eric Martin, Frank Stephan. 378-388 [doi]
• Some Notes on Degree Spectra of the StructuresIskander Sh. Kalimullin. 389-397 [doi]
• Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent CalculusKentaro Kikuchi. 398-407 [doi]
• The Polynomial and Linear Hierarchies in V:::0:::Leszek Aleksander Kolodziejczyk, Neil Thapen. 408-415 [doi]
• The Uniformity Principle for ::::Sigma:::: -Definability with Applications to Computable AnalysisMargarita V. Korovina, Oleg V. Kudinov. 416-425 [doi]
• Circuit Complexity of Regular LanguagesMichal Koucký. 426-435 [doi]
• Definability in the Homomorphic Quasiorder of Finite Labeled ForestsOleg V. Kudinov, Victor L. Selivanov. 436-445 [doi]
• Physics and Computation: The Status of Landauer s PrincipleJames Ladyman. 446-454 [doi]
• Strict Self-assembly of Discrete Sierpinski TrianglesJames I. Lathrop, Jack H. Lutz, Scott M. Summers. 455-464 [doi]
• Binary Trees and (Maximal) Order TypesGyesik Lee. 465-473 [doi]
• A Weakly 2-Random Set That Is Not Generalized LowAndrew Lewis, Antonio Montalbán, André Nies. 474-477 [doi]
• Speed-Up Theorems in Type-2 ComputationChung-Chih Li. 478-487 [doi]
• The Complexity of Quickly ORM-Decidable SetsJoel David Hamkins, David Linetsky, Russell Miller. 488-496 [doi]
• On Accepting Networks of Splicing Processors of Size 3Remco Loos. 497-506 [doi]
• Liquid ComputingWolfgang Maass. 507-516 [doi]
• Quotients over Minimal Type TheoryMaria Emilia Maietti. 517-531 [doi]
• Hairpin Completion Versus Hairpin ReductionFlorin Manea, Victor Mitrana. 532-541 [doi]
• Hierarchies in Fragments of Monadic Strict NPBarnaby Martin, Florent R. Madelaine. 542-550 [doi]
• Membrane Systems and Their Application to Systems BiologyGiancarlo Mauri. 551-553 [doi]
• Some Aspects of a Complexity Theory for Continuous Time SystemsMarco Gori, Klaus Meer. 554-565 [doi]
• Enumerations and Torsion Free Abelian GroupsAlexander G. Melnikov. 566-574 [doi]
• Locally Computable StructuresRussell G. Miller. 575-584 [doi]
• Logic and ControlAnil Nerode. 585-597 [doi]
• Nash Stability in Additively Separable Hedonic Games Is NP-HardMartin Olsen. 598-605 [doi]
• Comparing Notions of Computational EntropyAlexandre Pinto. 606-620 [doi]
• From Logic to Physics: How the Meaning of Computation Changed over TimeItamar Pitowsky. 621-631 [doi]
• Theories and Ordinals: Ordinal AnalysisMichael Rathjen. 632-637 [doi]
• Computable Riemann SurfacesRobert Rettinger. 638-647 [doi]
• Rank Lower Bounds for the Sherali-Adams OperatorMark Rhodes. 648-659 [doi]
• Infinite Computations and a Hierarchy in ::::Delta:::: ::3::Branislav Rovan, L ubos Steskal. 660-669 [doi]
• Natural Computing: A Natural and Timely Trend for Natural Sciences and Science of ComputationGrzegorz Rozenberg. 670-671 [doi]
• Biochemical Reactions as ComputationsAndrzej Ehrenfeucht, Grzegorz Rozenberg. 672-673 [doi]
• Doing Without Turing Machines: Constructivism and Formal TopologyGiovanni Sambin. 674-675 [doi]
• Problems as SolutionsPeter Schuster. 676-684 [doi]
• A Useful Undecidable TheoryVictor L. Selivanov. 685-694 [doi]
• On the Computational Power of Flip-Flop Proteins on MembranesShankara Narayanan Krishna. 695-704 [doi]
• Computability and IncomputabilityRobert I. Soare. 705-715 [doi]
• A Jump Inversion Theorem for the Degree SpectraAlexandra A. Soskova. 716-726 [doi]
• Cupping D::2:::::0::: Enumeration Degrees to 0 :: ::::e:::: :: Mariya Ivanova Soskova, Guohua Wu. 727-738 [doi]
• What Is the Lesson of Quantum Computing?Christopher G. Timpson. 739-741 [doi]
• Does the Cell Compute?Giuseppe Trautteur. 742-747 [doi]
• Computational Complexity of Constraint SatisfactionHeribert Vollmer. 748-757 [doi]
• Finding Most Likely SolutionsOsamu Watanabe, Mikael Onsjö. 758-767 [doi]
• Turing Unbound: Transfinite ComputationPhilip D. Welch. 768-780 [doi]
• Computability in Amorphous StructuresJirí Wiedermann, Lukás Petru. 781-790 [doi]
• The Complexity of Small Universal Turing MachinesDamien Woods, Turlough Neary. 791-799 [doi]
• Approximating Generalized Multicut on TreesPeng Zhang. 799-808 [doi]
• (Short) Survey of Real HypercomputationMartin Ziegler. 809-824 [doi]