A NATURAL AXIOMATIZATION OF COMPUTABILITY AND PROOF OF CHURCH’S THESIS

by Nachum Dershowitz , Yuri Gurevich
Citations:10 - 7 self

Active Bibliography

1 A natural axiomatization of Church’s thesis – Nachum Dershowitz, Yuri Gurevich - 2007
1 Historical Projects in Discrete Mathematics and Computer Science – Janet Barnett, Guram Bezhanishvili, Hing Leung, Jerry Lodder, David Pengelley, Desh Ranjan
1 Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory – Robert I. Soare - 2009
If intelligence is computable, then... – Peter Kugel - 2003
25 Computability and recursion – Robert I. Soare - 1996
Effectiveness ∗ – Nachum Dershowitz, Evgenia Falkovich, Gleichung Eine, Diophantische Gleichung - 2011
Church’s Thesis – Guram Bezhanishvili
3 Computability and Incomputability – Robert I. Soare
The Generic Model of Computation – Nachum Dershowitz
3 Towards a theory of intelligence – Peter Kugel
11 The many forms of hypercomputation – Toby Ord - 2006
1 The physical and philosophical implications of the Church-Turing thesis – Eleni Pagani - 2004
4 Church's Thesis and Hume's Problem – Kevin T. Kelly, Oliver Schulte - 1995
21 Algorithmic Theories Of Everything – Jürgen Schmidhuber - 2000
Information Processing, Computation . . . – Gualtiero Piccinini, Andrea Scarantino
The Influence of Domain . . . – Udi Boker - 2008
Paraconsistent Machines and their Relation to Quantum Computing – unknown authors - 802
A Paraconsistent Approach to Quantum Computing – unknown authors - 802
11 Physical Hypercomputation and the Church–Turing Thesis – Oron Shagrir, et al. - 2003