Gödel on Turing on Computability

[1]  Robert I. Soare,et al.  Computability and Recursion , 1996, Bulletin of Symbolic Logic.

[2]  Oron Shagrir,et al.  Physical Hypercomputation and the Church–Turing Thesis , 2003, Minds and Machines.

[3]  Christopher S. Hill,et al.  Mechanism, Mentalism and Metamathematics , 1980 .

[4]  Wilfried Sieg,et al.  Calculations by Man and Machine: Conceptual Analysis , 2000 .

[5]  Wilfried Sieg,et al.  Gödel on Computability , 2006 .

[6]  Kurt Gödel,et al.  On Formally Undecidable Propositions of Principia Mathematica and Related Systems , 1966 .

[7]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[8]  Oron Shagrir,et al.  Effective Computation by Humans and Machines , 2002, Minds and Machines.

[9]  Martin D. Davis,et al.  Why Gödel Didn't Have Church's Thesis , 1982, Inf. Control..

[10]  Wilfried Sieg,et al.  Mechanical Procedures and Mathematical Experience , 1991 .

[11]  B. Jack Copeland,et al.  Accelerating Turing Machines , 2002, Minds and Machines.

[12]  Alonzo Church,et al.  A note on the Entscheidungsproblem , 1936, Journal of Symbolic Logic.

[13]  W. Pitts,et al.  A Logical Calculus of the Ideas Immanent in Nervous Activity (1943) , 2021, Ideas That Created the Future.

[14]  M. Detlefsen.  Hilbert's program , 1986 .

[15]  Kurt Gödel,et al.  On undecidable propositions of formal mathematical systems , 1934 .

[16]  A. Church.  An Unsolvable Problem of Elementary Number Theory , 1936 .

[17]  B. Jack Copeland,et al.  The Church-Turing Thesis , 2007 .

[18]  A. M. Turing,et al.  Computing Machinery and Intelligence , 1950, The Philosophy of Artificial Intelligence.

[19]  S. Kleene.  General recursive functions of natural numbers , 1936 .

[20]  Wilfried Sieg,et al.  An abstract model for parallel computations : Gandy's thesis , 1999 .

[21]  Emil L. Post.  Finite combinatory processes—formulation , 1936, Journal of Symbolic Logic.