|
25
|
Computability and recursion
– Robert I. Soare
- 1996
|
|
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
|
|
|
Extensions, Automorphisms, and Definability
– Robert I. Soare
|
|
|
Church’s Thesis
– Guram Bezhanishvili
|
|
1
|
A natural axiomatization of Church’s thesis
– Nachum Dershowitz, Yuri Gurevich
- 2007
|
|
|
UNDECIDABLE PROBLEMS: A SAMPLER
– Bjorn Poonen
|
|
|
Arithmetic and the Incompleteness Theorems
– Richard W. Kaye
- 2000
|
|
|
Effectiveness ∗
– Nachum Dershowitz, Evgenia Falkovich, Gleichung Eine, Diophantische Gleichung
- 2011
|
|
5
|
Termination, AC-Termination and Dependency Pairs of Term Rewriting Systems
– Keiichirou Kusakari
- 2000
|
|
|
Undecidability in quantum mechanics
– Luigi Foschini
- 1998
|
|
10
|
A NATURAL AXIOMATIZATION OF COMPUTABILITY AND PROOF OF CHURCH’S THESIS
– Nachum Dershowitz, Yuri Gurevich
|
|
11
|
Physical Hypercomputation and the Church–Turing Thesis
– Oron Shagrir, et al.
- 2003
|
|
|
Kleene’s Amazing Second Recursion Theorem Extended Abstract ⋆
– Yiannis N. Moschovakis
|
|
8
|
The Church-Turing Thesis over Arbitrary Domains
– Udi Boker, Nachum Dershowitz
- 2008
|
|
11
|
The many forms of hypercomputation
– Toby Ord
- 2006
|
|
|
JACQUES HERBRAND: LIFE, LOGIC, AND AUTOMATED DEDUCTION
– Claus-peter Wirth, Jörg Siekmann, Christoph Benzmüller, Serge Autexier
|
|
|
Universality, Turing Incompleteness and Observers
– Klaus Sutner
|
|
3
|
Mass problems and measure-theoretic regularity
– Stephen G. Simpson
- 2009
|
