Active Bibliography

1 Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory – Robert I. Soare - 2009
1 Historical Projects in Discrete Mathematics and Computer Science – Janet Barnett, Guram Bezhanishvili, Hing Leung, Jerry Lodder, David Pengelley, Desh Ranjan
3 Computability and Incomputability – Robert I. Soare
Church’s Thesis – Guram Bezhanishvili
1 A natural axiomatization of Church’s thesis – Nachum Dershowitz, Yuri Gurevich - 2007
10 Notions of computability at higher types I – John Longley - 2005
Extensions, Automorphisms, and Definability – Robert I. Soare
Arithmetic and the Incompleteness Theorems – Richard W. Kaye - 2000
JACQUES HERBRAND: LIFE, LOGIC, AND AUTOMATED DEDUCTION – Claus-peter Wirth, Jörg Siekmann, Christoph Benzmüller, Serge Autexier
Lambda-Calculus and Functional Programming – Jonathan P. Seldin
5 Termination, AC-Termination and Dependency Pairs of Term Rewriting Systems – Keiichirou Kusakari - 2000
UNDECIDABLE PROBLEMS: A SAMPLER – Bjorn Poonen
10 A NATURAL AXIOMATIZATION OF COMPUTABILITY AND PROOF OF CHURCH’S THESIS – Nachum Dershowitz, Yuri Gurevich
Kleene’s Amazing Second Recursion Theorem Extended Abstract ⋆ – Yiannis N. Moschovakis
Effectiveness ∗ – Nachum Dershowitz, Evgenia Falkovich, Gleichung Eine, Diophantische Gleichung - 2011
1 The Church-Turing Thesis as an Immature Form of the Zuse-Fredkin Thesis (More Arguments in Support of the “Universe as a Cellular Automaton” Idea) – Plamen Petrov
1 Gödel on computability * – Wilfried Sieg
13 Computation and Hypercomputation – Mike Stannett - 2003
A Study of Logic and Programming via Turing Machines – Jerry M. Lodder