| 2006 | Degrees of Weakly Computable Reals. | Keng Meng Ng, Frank Stephan, Guohua Wu |
| 2006 | Can General Relativistic Computers Break the Turing Barrier?. | Istvn Nmeti, Hajnal Andrka |
| 2006 | A Measure of Space for Computing over the Reals. | Paulin Jacob de Naurois |
| 2006 | Martingale Families and Dimension in P. | Philippe Moser |
| 2006 | Constraints on Hypercomputation. | Greg Michaelson, W. Paul Cockshott |
| 2006 | Uncomputability Below the Real Halting Problem. | Klaus Meer, Martin Ziegler |
| 2006 | Optimization and Approximation Problems Related to Polynomial System Solving. | Klaus Meer |
| 2006 | Two Open Problems on Effective Dimension. | Elvira Mayordomo |
| 2006 | Towards a Trichotomy for Quantified | Barnaby Martin, Florent R. Madelaine |
| 2006 | From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials. | Johann A. Makowsky |
| 2006 | Space Bounds for Infinitary Computation. | Benedikt Lwe |
| 2006 | The Jump Classes of Minimal Covers. | Andrew E. M. Lewis |
| 2006 | Lower Bounds Using Kolmogorov Complexity. | Sophie Laplante |
| 2006 | An Invariant Cost Model for the Lambda Calculus. | Ugo Dal Lago, Simone Martini |
| 2006 | Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests. | Oleg V. Kudinov, Victor L. Selivanov |
| 2006 | Complexity-Theoretic Hierarchies. | Lars Kristiansen |
| 2006 | Upper and Lower Bounds for the Computational Power of P Systems with Mobile Membranes. | Shankara Narayanan Krishna |
| 2006 | Forcing with Random Variables and Proof Complexity. | Jan Krajcek |
| 2006 | Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems. | Margarita V. Korovina, Nicolai N. Vorobjov Jr. |
| 2006 | Infinite Time Register Machines. | Peter Koepke |
| 2006 | On Graph Isomorphism for Restricted Graph Classes. | Johannes Kbler |
| 2006 | Coinductive Proofs for Basic Real Computation. | Tie Hou |
| 2006 | Enumeration Reducibility with Polynomial Time Bounds. | Charles M. Harris |
| 2006 | An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel Measurability. | Guido Gherardi |
| 2006 | What Does the Incompleteness Theorem Add to the Unsolvability of the Halting Problem? | Torkel Franzn |