1. Computation and Logic in the Real World: CiE 2007

   • S. Barry Cooper
   • Elvira Mayordomo
   • Andrea Sorbi

   EditorialNotes 25 December 2008 Pages: 647 - 649

2. Between Order and Chaos: The Quest for Meaningful Information

   • Pieter Adriaans

   OriginalPaper Open access 14 February 2009 Pages: 650 - 674

3. Planar and Grid Graph Reachability Problems

   • Eric Allender
   • David A. Mix Barrington
   • Sambuddha Roy

   OriginalPaper 05 February 2009 Pages: 675 - 723

4. Depth as Randomness Deficiency

   • Luís Antunes
   • Armando Matos
   • Paul Vitányi

   OriginalPaper 05 February 2009 Pages: 724 - 739

5. Constructive Dimension and Turing Degrees

   • Laurent Bienvenu
   • David Doty
   • Frank Stephan

   OriginalPaper 27 January 2009 Pages: 740 - 755

6. Characterizing Programming Systems Allowing Program Self-Reference

   • John Case
   • Samuel E. Moelius III

   OriginalPaper 04 February 2009 Pages: 756 - 772

7. Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems

   • John Case

   OriginalPaper 05 February 2009 Pages: 773 - 786

8. Two Algorithms in Search of a Type-System

   • Norman Danner
   • James S. Royer

   OriginalPaper 05 February 2009 Pages: 787 - 821

9. The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number

   • Michael Fellows
   • Daniel Lokshtanov
   • Saket Saurabh

   OriginalPaper 29 January 2009 Pages: 822 - 848

10. Input-Dependence in Function-Learning

    • Sanjay Jain
    • Eric Martin
    • Frank Stephan

    OriginalPaper 27 January 2009 Pages: 849 - 864

11. Circuit Complexity of Regular Languages

    • Michal Koucký

    OriginalPaper 27 January 2009 Pages: 865 - 879

12. Speed-Up Theorems in Type-2 Computations Using Oracle Turing Machines

    • Chung-Chih Li

    OriginalPaper 29 January 2009 Pages: 880 - 896

13. Enumerations and Completely Decomposable Torsion-Free Abelian Groups

    • Alexander G. Melnikov

    OriginalPaper 05 February 2009 Pages: 897 - 916

14. Nash Stability in Additively Separable Hedonic Games and Community Structures

    • Martin Olsen

    OriginalPaper 27 January 2009 Pages: 917 - 925

15. Theory of Computing Systems (TOCS) Submission Version Finding Most Likely Solutions

    • Mikael Onsjö
    • Osamu Watanabe

    OriginalPaper 27 January 2009 Pages: 926 - 942

16. Finding Most Likely Solutions

    • Mikael Onsjö
    • Osamu Watanabe

    Erratum 25 July 2009 Pages: 943 - 943

17. Comparing Notions of Computational Entropy

    • Alexandre Pinto

    OriginalPaper 27 January 2009 Pages: 944 - 962

18. The λ-Calculus and the Unity of Structural Proof Theory

    • José Espírito Santo

    OriginalPaper 05 February 2009 Pages: 963 - 994

19. On the Universal Computing Power of Amorphous Computing Systems

    • Jiří Wiedermann
    • Lukáš Petrů

    OriginalPaper 27 January 2009 Pages: 995 - 1010