Table of Contents

• Ordinal Analysis and the Infinite Ramsey TheoremBahareh Afshari, Michael Rathjen. 1-10 [doi]
• Curiouser and Curiouser: The Link between Incompressibility and ComplexityEric Allender. 11-16 [doi]
• Information and Logical DiscriminationPatrick Allo. 17-28 [doi]
• Robustness of Logical DepthLuis Filipe Coelho Antunes, Andre Souto, Andreia Teixeira. 29-34 [doi]
• Turing's Normal Numbers: Towards RandomnessVerónica Becher. 35-45 [doi]
• Logic of Ruler and Compass ConstructionsMichael Beeson. 46-55 [doi]
• On the Computational Content of the Brouwer Fixed Point TheoremVasco Brattka, Stéphane Le Roux, Arno Pauly. 56-67 [doi]
• Square Roots and Powers in Constructive Banach Algebra TheoryDouglas S. Bridges, Robin Havea. 68-77 [doi]
• The Mate-in-n Problem of Infinite Chess Is DecidableDan Brumleve, Joel David Hamkins, Philipp Schlicht. 78-88 [doi]
• A Note on Ramsey Theorems and Turing JumpsLorenzo Carlucci, Konrad Zdanowski. 89-95 [doi]
• Automatic Functions, Linear Time and LearningJohn Case, Sanjay Jain, Samuel Seah, Frank Stephan. 96-106 [doi]
• An Undecidable Nested Recurrence RelationMarcel Celaya, Frank Ruskey. 107-117 [doi]
• Hard Instances of Algorithms and Proof SystemsYijia Chen, Jörg Flum, Moritz Müller. 118-128 [doi]
• On Mathias Generic SetsPeter Cholak, Damir D. Dzhafarov, Jeffry L. Hirst. 129-138 [doi]
• Complexity of Deep Inference via Atomic FlowsAnupam Das. 139-150 [doi]
• Connecting Partial Words and Regular LanguagesJürgen Dassow, Florin Manea, Robert Mercas. 151-161 [doi]
• Randomness, Computation and MathematicsRod Downey. 162-181 [doi]
• Learning, Social Intelligence and the Turing Test - Why an "Out-of-the-Box" Turing Machine Will Not Pass the Turing TestBruce Edmonds, Carlos Gershenson. 182-192 [doi]
• Confluence in Data Reduction: Bridging Graph Transformation and KernelizationHartmut Ehrig, Claudia Ermel, Falk Hüffner, Rolf Niedermeier, Olga Runge. 193-202 [doi]
• Highness and Local NoncappabilityChengling Fang, Wang Shenling, Guohua Wu. 203-211 [doi]
• Turing Progressions and Their Well-OrdersDavid Fernández Duque, Joost J. Joosten. 212-221 [doi]
• A Short Note on Spector's Proof of Consistency of AnalysisFernando Ferreira. 222-227 [doi]
• Sets of Signals, Information Flow, and FolktalesMark Alan Finlayson. 228-236 [doi]
• On the Foundations and Philosophy of Info-metricsAmos Golan. 237-244 [doi]
• On Mathematicians Who Liked Logic - The Case of Max NewmanIvor Grattan-Guinness. 245-252 [doi]
• Densities and Entropies in Cellular AutomataPierre Guillon, Charalampos Zinoviadis. 253-263 [doi]
• Foundational Analyses of ComputationYuri Gurevich. 264-275 [doi]
• Turing Machine-Inspired Computer Science ResultsJuris Hartmanis. 276-282 [doi]
• NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic GraphsSepp Hartung, André Nichterlein. 283-292 [doi]
• A Direct Proof of Wiener's TheoremMatthew Hendtlass, Peter Schuster. 293-302 [doi]
• Effective Strong Nullness and Effectively Closed SetsKojiro Higuchi, Takayuki Kihara. 303-312 [doi]
• Word Automaticity of Tree Automatic Scattered Linear Orderings Is DecidableMartin Huschenbett. 313-322 [doi]
• On the Relative Succinctness of Two Extensions by Definitions of Multimodal LogicWiebe van der Hoek, Petar Iliev, Barteld P. Kooi. 323-333 [doi]
• On Immortal Configurations in Turing MachinesEmmanuel Jeandel. 334-343 [doi]
• A Slime Mold Solver for Linear Programming ProblemsAnders Johannson, James Y. Zou. 344-354 [doi]
• Multi-scale Modeling of Gene Regulation of MorphogenesisJaap A. Kaandorp, Daniel Botman, Carlos Tamulonis, Roland Dries. 355-362 [doi]
• Tree-Automatic Well-Founded TreesAlexander Kartzow, Jiamou Liu, Markus Lohrey. 363-373 [doi]
• Infinite Games and Transfinite Recursion of Multiple Inductive DefinitionsKeisuke Yoshii, Kazuyuki Tanaka. 374-383 [doi]
• A Hierarchy of Immunity and Density for Sets of RealsTakayuki Kihara. 384-394 [doi]
• How Much Randomness Is Needed for Statistics?Bjørn Kjos-Hanssen, Antoine Taveneaux, Neil Thapen. 395-404 [doi]
• Towards a Theory of Infinite Time Blum-Shub-Smale MachinesPeter Koepke, Benjamin Seyfferth. 405-415 [doi]
• Turing Pattern Formation without DiffusionShigeru Kondo. 416-421 [doi]
• Degrees of Total Algorithms versus Degrees of Honest FunctionsLars Kristiansen. 422-431 [doi]
• A 5n - o(n) Lower Bound on the Circuit Size over U 2 of a Linear Boolean FunctionAlexander S. Kulikov, Olga Melanich, Ivan Mihajlin. 432-439 [doi]
• Local Induction and Provably Total Computable Functions: A Case StudyAndrés Cordón-Franco, Francisco Félix Lara Martín. 440-449 [doi]
• What is Turing's Comparison between Mechanism and Writing Worth?Jean Lassègue, Giuseppe Longo. 450-461 [doi]
• Substitutions and Strongly Deterministic TilesetsBastien Le Gloannec, Nicolas Ollinger. 462-471 [doi]
• The Computing SpacetimeFotini Markopoulou. 472-484 [doi]
• Unifiability and Admissibility in Finite AlgebrasGeorge Metcalfe, Christoph Röthlisberger. 485-495 [doi]
• Natural SignsRuth Garrett Millikan. 496-506 [doi]
• Characteristics of Minimal Effective Programming SystemsSamuel E. Moelius III. 507-516 [doi]
• After Turing: Mathematical Modelling in the Biomedical and Social Sciences - From Animal Coat Patterns to Brain Tumours to Saving MarriagesJames D. Murray. 517-527 [doi]
• Existence of Faster than Light Signals Implies Hypercomputation already in Special RelativityPéter Németi, Gergely Székely. 528-538 [doi]
• Turing Computable Embeddings and Coding Families of SetsVíctor A. Ocasio-González. 539-548 [doi]
• On the Behavior of Tile Assembly System at High TemperaturesShinnosuke Seki, Yasushi Okuno. 549-559 [doi]
• Abstract Partial Cylindrical Algebraic Decomposition I: The Lifting PhaseGrant Olney Passmore, Paul B. Jackson. 560-570 [doi]
• Multi-valued Functions in Computability TheoryArno Pauly. 571-580 [doi]
• Relative Randomness for Martin-Löf Random SetsNingNing Peng, Kojiro Higuchi, Takeshi Yamazaki, Kazuyuki Tanaka. 581-588 [doi]
• On the Tarski-Lindenbaum Algebra of the Class of all Strongly Constructivizable Prime ModelsMikhail G. Peretyat'kin. 589-598 [doi]
• Lower Bound on Weights of Large Degree Threshold FunctionsVladimir V. Podolskii. 599-608 [doi]
• What Are Computers (If They're not Thinking Things)?John Preston. 609-615 [doi]
• Compactness and the Effectivity of UniformizationRobert Rettinger. 616-625 [doi]
• On the Computability Power of Membrane Systems with Controlled MobilityShankara Narayanan Krishna, Bogdan Aman, Gabriel Ciobanu. 626-635 [doi]
• On Shift Spaces with Algebraic StructureVille Salo, Ilkka Törmä. 636-645 [doi]
• Finite State Verifiers with Constant RandomnessA. C. Cem Say, Abuzer Yakaryilmaz. 646-654 [doi]
• Game Arguments in Computability Theory and Algorithmic Information TheoryAlexander Shen. 655-666 [doi]
• Turing Patterns in DesertsJonathan A. Sherratt. 667-674 [doi]
• Subsymbolic Computation Theory for the Human Intuitive ProcessorPaul Smolensky. 675-685 [doi]
• A Correspondence Principle for Exact Constructive DimensionLudwig Staiger. 686-695 [doi]
• Low n Boolean SubalgebrasRebecca M. Steiner. 696-702 [doi]
• Bringing Up Turing's 'Child-Machine'Susan G. Sterrett. 703-713 [doi]
• Is Turing's Thesis the Consequence of a More General Physical Principle?Matthew P. Szudzik. 714-722 [doi]
• Some Natural Zero One Laws for Ordinals Below ε 0Andreas Weiermann, Alan R. Woods. 723-732 [doi]
• On the Road to Thinking Machines: Insights and IdeasJirí Wiedermann. 733-744 [doi]
• Making Solomonoff Induction Effective - Or: You Can Learn What You Can BoundJörg Zimmermann, Armin B. Cremers. 745-754 [doi]