Active Bibliography

32 Computability and recursion – Robert I. Soare - 1996
3 Computability and Incomputability – Robert I. Soare
5 How much can analog and hybrid systems be proved (super-)Turing – Olivier Bournez - 2006
4 Boolean relation theory and . . . – Harvey M. Friedman - 2011
4 Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory – Robert I. Soare - 2009
2 Historical Projects in Discrete Mathematics and Computer Science – Janet Barnett, Guram Bezhanishvili, Hing Leung, Jerry Lodder, David Pengelley, Desh Ranjan
Extensions, Automorphisms, and Definability – Robert I. Soare
Undecidability of First-Order Logic – Guram Bezhanishvili, Lawrence S. Moss
36 The Convenience of Tilings – Peter Van Emde Boas - 1997
Arithmetic and the Incompleteness Theorems – Richard W. Kaye - 2000
5 The history and concept of computability – Robert I. Soare - 1999
4 Alan Turing and the Mathematical Objection – Gualtiero Piccinini - 2003
JACQUES HERBRAND: LIFE, LOGIC, AND AUTOMATED DEDUCTION – Claus-peter Wirth, Jörg Siekmann, Christoph Benzmüller, Serge Autexier
development of computer science – J. Díaz C. Torras
A personal account of Turing’s imprint on the development of computer science – J. Díaz, C. Torras
Universality, Turing Incompleteness and Observers – Klaus Sutner
21 Hypercomputation and the Physical Church-Turing Thesis – Paolo Cotogno - 2003
5 Termination, AC-Termination and Dependency Pairs of Term Rewriting Systems – Keiichirou Kusakari - 2000
Church’s Thesis – Guram Bezhanishvili