| 2012 | A 5n - o(n) Lower Bound on the Circuit Size over U 2 of a Linear Boolean Function. Alexander S. Kulikov, Olga Melanich, Ivan Mihajlin |
| 2012 | A Correspondence Principle for Exact Constructive Dimension. Ludwig Staiger |
| 2012 | A Direct Proof of Wiener's Theorem. Matthew Hendtlass, Peter Schuster |
| 2012 | A Hierarchy of Immunity and Density for Sets of Reals. Takayuki Kihara |
| 2012 | A Note on Ramsey Theorems and Turing Jumps. Lorenzo Carlucci, Konrad Zdanowski |
| 2012 | A Short Note on Spector's Proof of Consistency of Analysis. Fernando Ferreira |
| 2012 | A Slime Mold Solver for Linear Programming Problems. Anders Johannson, James Y. Zou |
| 2012 | Abstract Partial Cylindrical Algebraic Decomposition I: The Lifting Phase. Grant Olney Passmore, Paul B. Jackson |
| 2012 | After Turing: Mathematical Modelling in the Biomedical and Social Sciences - From Animal Coat Patterns to Brain Tumours to Saving Marriages. James D. Murray |
| 2012 | An Undecidable Nested Recurrence Relation. Marcel Celaya, Frank Ruskey |
| 2012 | Automatic Functions, Linear Time and Learning. John Case, Sanjay Jain, Samuel Seah, Frank Stephan |
| 2012 | Bringing Up Turing's 'Child-Machine'. Susan G. Sterrett |
| 2012 | Characteristics of Minimal Effective Programming Systems. Samuel E. Moelius III |
| 2012 | Compactness and the Effectivity of Uniformization. Robert Rettinger |
| 2012 | Complexity of Deep Inference via Atomic Flows. Anupam Das |
| 2012 | Confluence in Data Reduction: Bridging Graph Transformation and Kernelization. Hartmut Ehrig, Claudia Ermel, Falk Hüffner, Rolf Niedermeier, Olga Runge |
| 2012 | Connecting Partial Words and Regular Languages. Jürgen Dassow, Florin Manea, Robert Mercas |
| 2012 | Curiouser and Curiouser: The Link between Incompressibility and Complexity. Eric Allender |
| 2012 | Degrees of Total Algorithms versus Degrees of Honest Functions. Lars Kristiansen |
| 2012 | Densities and Entropies in Cellular Automata. Pierre Guillon, Charalampos Zinoviadis |
| 2012 | Effective Strong Nullness and Effectively Closed Sets. Kojiro Higuchi, Takayuki Kihara |
| 2012 | Existence of Faster than Light Signals Implies Hypercomputation already in Special Relativity. Péter Németi, Gergely Székely |
| 2012 | Finite State Verifiers with Constant Randomness. A. C. Cem Say, Abuzer Yakaryilmaz |
| 2012 | Foundational Analyses of Computation. Yuri Gurevich |
| 2012 | Game Arguments in Computability Theory and Algorithmic Information Theory. Alexander Shen |
| 2012 | Hard Instances of Algorithms and Proof Systems. Yijia Chen, Jörg Flum, Moritz Müller |
| 2012 | Highness and Local Noncappability. Chengling Fang, Shenling Wang, Guohua Wu |
| 2012 | How Much Randomness Is Needed for Statistics? Bjørn Kjos-Hanssen, Antoine Taveneaux, Neil Thapen |
| 2012 | How the World Computes - Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings S. Barry Cooper, Anuj Dawar, Benedikt Löwe |
| 2012 | Infinite Games and Transfinite Recursion of Multiple Inductive Definitions. Keisuke Yoshii, Kazuyuki Tanaka |
| 2012 | Information and Logical Discrimination. Patrick Allo |
| 2012 | Is Turing's Thesis the Consequence of a More General Physical Principle? Matthew P. Szudzik |
| 2012 | Learning, Social Intelligence and the Turing Test - Why an "Out-of-the-Box" Turing Machine Will Not Pass the Turing Test. Bruce Edmonds, Carlos Gershenson |
| 2012 | Local Induction and Provably Total Computable Functions: A Case Study. Andrés Cordón-Franco, Francisco Félix Lara Martín |
| 2012 | Logic of Ruler and Compass Constructions. Michael Beeson |
| 2012 | Low n Boolean Subalgebras. Rebecca M. Steiner |
| 2012 | Lower Bound on Weights of Large Degree Threshold Functions. Vladimir V. Podolskii |
| 2012 | Making Solomonoff Induction Effective - Or: You Can Learn What You Can Bound. Jörg Zimmermann, Armin B. Cremers |
| 2012 | Multi-scale Modeling of Gene Regulation of Morphogenesis. Jaap A. Kaandorp, Daniel Botman, Carlos Tamulonis, Roland Dries |
| 2012 | Multi-valued Functions in Computability Theory. Arno Pauly |
| 2012 | NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs. Sepp Hartung, André Nichterlein |
| 2012 | Natural Signs. Ruth Garrett Millikan |
| 2012 | On Immortal Configurations in Turing Machines. Emmanuel Jeandel |
| 2012 | On Mathematicians Who Liked Logic - The Case of Max Newman. Ivor Grattan-Guinness |
| 2012 | On Mathias Generic Sets. Peter Cholak, Damir D. Dzhafarov, Jeffry L. Hirst |
| 2012 | On Shift Spaces with Algebraic Structure. Ville Salo, Ilkka Törmä |
| 2012 | On the Behavior of Tile Assembly System at High Temperatures. Shinnosuke Seki, Yasushi Okuno |
| 2012 | On the Computability Power of Membrane Systems with Controlled Mobility. Shankara Narayanan Krishna, Bogdan Aman, Gabriel Ciobanu |
| 2012 | On the Computational Content of the Brouwer Fixed Point Theorem. Vasco Brattka, Stéphane Le Roux, Arno Pauly |
| 2012 | On the Foundations and Philosophy of Info-metrics. Amos Golan |
| 2012 | On the Relative Succinctness of Two Extensions by Definitions of Multimodal Logic. Wiebe van der Hoek, Petar Iliev, Barteld P. Kooi |
| 2012 | On the Road to Thinking Machines: Insights and Ideas. Jirí Wiedermann |
| 2012 | On the Tarski-Lindenbaum Algebra of the Class of all Strongly Constructivizable Prime Models. Mikhail G. Peretyat'kin |
| 2012 | Ordinal Analysis and the Infinite Ramsey Theorem. Bahareh Afshari, Michael Rathjen |
| 2012 | Randomness, Computation and Mathematics. Rod Downey |
| 2012 | Relative Randomness for Martin-Löf Random Sets. NingNing Peng, Kojiro Higuchi, Takeshi Yamazaki, Kazuyuki Tanaka |
| 2012 | Robustness of Logical Depth. Luis Filipe Coelho Antunes, Andre Souto, Andreia Teixeira |
| 2012 | Sets of Signals, Information Flow, and Folktales. Mark Alan Finlayson |
| 2012 | Some Natural Zero One Laws for Ordinals Below ε 0. Andreas Weiermann, Alan R. Woods |
| 2012 | Square Roots and Powers in Constructive Banach Algebra Theory. Douglas S. Bridges, Robin Havea |
| 2012 | Substitutions and Strongly Deterministic Tilesets. Bastien Le Gloannec, Nicolas Ollinger |
| 2012 | Subsymbolic Computation Theory for the Human Intuitive Processor. Paul Smolensky |
| 2012 | The Computing Spacetime. Fotini Markopoulou |
| 2012 | The Mate-in-n Problem of Infinite Chess Is Decidable. Dan Brumleve, Joel David Hamkins, Philipp Schlicht |
| 2012 | Towards a Theory of Infinite Time Blum-Shub-Smale Machines. Peter Koepke, Benjamin Seyfferth |
| 2012 | Tree-Automatic Well-Founded Trees. Alexander Kartzow, Jiamou Liu, Markus Lohrey |
| 2012 | Turing Computable Embeddings and Coding Families of Sets. Víctor A. Ocasio-González |
| 2012 | Turing Machine-Inspired Computer Science Results. Juris Hartmanis |
| 2012 | Turing Pattern Formation without Diffusion. Shigeru Kondo |
| 2012 | Turing Patterns in Deserts. Jonathan A. Sherratt |
| 2012 | Turing Progressions and Their Well-Orders. David Fernández-Duque, Joost J. Joosten |
| 2012 | Turing's Normal Numbers: Towards Randomness. Verónica Becher |
| 2012 | Unifiability and Admissibility in Finite Algebras. George Metcalfe, Christoph Röthlisberger |
| 2012 | What Are Computers (If They're not Thinking Things)? John Preston |
| 2012 | What is Turing's Comparison between Mechanism and Writing Worth? Jean Lassègue, Giuseppe Longo |
| 2012 | Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable. Martin Huschenbett |