A Study of Logic and Programming via Turing Machines

by Jerry M. Lodder

Active Bibliography

2 Historical Projects in Discrete Mathematics and Computer Science – Janet Barnett, Guram Bezhanishvili, Hing Leung, Jerry Lodder, David Pengelley, Desh Ranjan
2 A natural axiomatization of Church’s thesis – Nachum Dershowitz, Yuri Gurevich - 2007
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
32 Computability and recursion – Robert I. Soare - 1996
Kurt Gödel, `Über formal unentscheidbare Sätze der Principia mathematica und verwandter Systeme I' (1931) – Richard Zach
5 The history and concept of computability – Robert I. Soare - 1999
4 Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory – Robert I. Soare - 2009
Undecidability in quantum mechanics – Luigi Foschini - 1998
4 Alan Turing and the Mathematical Objection – Gualtiero Piccinini - 2003
Church’s Thesis – Guram Bezhanishvili
5 How much can analog and hybrid systems be proved (super-)Turing – Olivier Bournez - 2006
3 Computability and Incomputability – Robert I. Soare
UNDECIDABLE PROBLEMS: A SAMPLER – Bjorn Poonen
1 Comparative Analysis of Hypercomputational Systems Submitted in partial fulfilment – Mariam Kiran, Supervisor Dr Mike Stannett
15 Computation and Hypercomputation – Mike Stannett - 2003
5 Gödel on computability – Wilfried Sieg
Hilbert and Set Theory – Burton Dreben , Akihiro Kanamori - 1997
4 Hilbert’s Program Then and Now – Richard Zach - 2005