| 2006 | A Computability Theory of Real Numbers. Xizhong Zheng |
| 2006 | A Measure of Space for Computing over the Reals. Paulin Jacobé de Naurois |
| 2006 | A Subrecursive Refinement of the Fundamental Theorem of Algebra. Peter Peshev, Dimiter Skordev |
| 2006 | Admissible Representations in Computable Analysis. Matthias Schröder |
| 2006 | An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel Measurability. Guido Gherardi |
| 2006 | An Introduction to Program and Thread Algebra. Alban Ponse, Mark van der Zwaag |
| 2006 | An Invariant Cost Model for the Lambda Calculus. Ugo Dal Lago, Simone Martini |
| 2006 | Böhm Trees, Krivine's Machine and the Taylor Expansion of Lambda-Terms. Thomas Ehrhard, Laurent Regnier |
| 2006 | Can General Relativistic Computers Break the Turing Barrier?. István Németi, Hajnal Andréka |
| 2006 | Co-total Enumeration Degrees. Boris Solon |
| 2006 | Coinductive Proofs for Basic Real Computation. Tie Hou |
| 2006 | Complexity-Theoretic Hierarchies. Lars Kristiansen |
| 2006 | Constraints on Hypercomputation. Greg Michaelson, W. Paul Cockshott |
| 2006 | Datatype-Generic Reasoning. Roland Carl Backhouse |
| 2006 | Deep Inference and Its Normal Form of Derivations. Kai Brünnler |
| 2006 | Degrees of Weakly Computable Reals. Keng Meng Ng, Frank Stephan, Guohua Wu |
| 2006 | Do Noetherian Modules Have Noetherian Basis Functions?. Peter Schuster, Júlia Zappe |
| 2006 | Elementary Algebraic Specifications of the Rational Function Field. Jan A. Bergstra |
| 2006 | Enumeration Reducibility with Polynomial Time Bounds. Charles M. Harris |
| 2006 | Every Sequence Is Decompressible from a Random One. David Doty |
| 2006 | Fast Quantifier Elimination Means P = NP. Mihai Prunescu |
| 2006 | Forcing with Random Variables and Proof Complexity. Jan Krajícek |
| 2006 | From Constructibility and Absoluteness to Computability and Domain Independence. Arnon Avron |
| 2006 | From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials. Johann A. Makowsky |
| 2006 | Gödel and the Origins of Computer Science. John W. Dawson Jr. |
| 2006 | Gödel's Conflicting Approaches to Effective Calculability. Wilfried Sieg |
| 2006 | Heap-Abstraction for an Object-Oriented Calculus with Thread Classes. Erika Ábrahám, Andreas Grüner, Martin Steffen |
| 2006 | Infinite Time Register Machines. Peter Koepke |
| 2006 | Inverting Monotone Continuous Functions in Constructive Analysis. Helmut Schwichtenberg |
| 2006 | Kurt Gödel and Computability Theory. Richard Zach |
| 2006 | LJQ: A Strongly Focused Calculus for Intuitionistic Logic. Roy Dyckhoff, Stéphane Lengrand |
| 2006 | Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings Arnold Beckmann, Ulrich Berger, Benedikt Löwe, John V. Tucker |
| 2006 | Logspace Complexity of Functions and Structures. Douglas Cenzer, Zia Uddin |
| 2006 | Lower Bounds Using Kolmogorov Complexity. Sophie Laplante |
| 2006 | Martingale Families and Dimension in P. Philippe Moser |
| 2006 | Non-deterministic Halting Times for Hamkins-Kidder Turing Machines. Philip D. Welch |
| 2006 | On Graph Isomorphism for Restricted Graph Classes. Johannes Köbler |
| 2006 | On the Complexity of the Sperner Lemma. Stefan S. Dantchev |
| 2006 | Optimization and Approximation Problems Related to Polynomial System Solving. Klaus Meer |
| 2006 | Partial Continuous Functions and Admissible Domain Representations. Fredrik Dahlgren |
| 2006 | Partial Recursive Functions in Martin-Löf Type Theory. Anton Setzer |
| 2006 | Partially Ordered Connectives and Sum Merlijn Sevenster, Tero Tulenheimo |
| 2006 | Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions. Andreas Weiermann |
| 2006 | Prefix-Like Complexities and Computability in the Limit. Alexey V. Chernov, Jürgen Schmidhuber |
| 2006 | Primitive Recursive Selection Functions over Abstract Algebras. Jeffery I. Zucker |
| 2006 | Random Closed Sets. Paul Brodhead, Douglas Cenzer, Seyyed Dashti |
| 2006 | Relativized Degree Spectra. Alexandra A. Soskova |
| 2006 | Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal. Jérôme Durand-Lose |
| 2006 | Space Bounds for Infinitary Computation. Benedikt Löwe |
| 2006 | The Church-Turing Thesis: Consensus and Opposition. Martin Davis |
| 2006 | The Jump Classes of Minimal Covers. Andrew E. M. Lewis |
| 2006 | The Logical Strength of the Uniform Continuity Theorem. Josef Berger |
| 2006 | The Role of Algebraic Models and Type-2 Theory of Effectivity in Special Purpose Processor Design. Gregorio de Miguel Casado, Juan Manuel García Chamizo |
| 2006 | Towards a Trichotomy for Quantified Barnaby Martin, Florent R. Madelaine |
| 2006 | Turing Universality in Dynamical Systems. Jean-Charles Delvenne |
| 2006 | Two Open Problems on Effective Dimension. Elvira Mayordomo |
| 2006 | Uncomputability Below the Real Halting Problem. Klaus Meer, Martin Ziegler |
| 2006 | Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests. Oleg V. Kudinov, Victor L. Selivanov |
| 2006 | Understanding and Using Spector's Bar Recursive Interpretation of Classical Analysis. Paulo Oliva |
| 2006 | Upper and Lower Bounds for the Computational Power of P Systems with Mobile Membranes. Shankara Narayanan Krishna |
| 2006 | Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems. Margarita V. Korovina, Nicolai N. Vorobjov Jr. |
| 2006 | What Does the Incompleteness Theorem Add to the Unsolvability of the Halting Problem? Torkel Franzén |