|
1
|
Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory
– Robert I. Soare
- 2009
|
|
25
|
Computability and recursion
– Robert I. Soare
- 1996
|
|
|
Church’s Thesis
– Guram Bezhanishvili
|
|
1
|
Historical Projects in Discrete Mathematics and Computer Science
– Janet Barnett, Guram Bezhanishvili, Hing Leung, Jerry Lodder, David Pengelley, Desh Ranjan
|
|
|
Levels of Undecidability in Rewriting
– Jörg Endrullis , Herman Geuvers , Jakob Grue Simonsen , Hans Zantema
- 2011
|
|
10
|
Notions of computability at higher types I
– John Longley
- 2005
|
|
3
|
Computability and Incomputability
– Robert I. Soare
|
|
|
The Mathematical Work of S.C. Kleene
– J.R. Shoenfield
- 1995
|
|
|
Computable Real Functions: Type 1 Computability Versus Type 2 Computability
– Peter Hertling
- 1996
|
|
10
|
Semantics vs. Syntax vs. Computations -- Machine Models For Type-2 . . .
– James Royer
- 1997
|
|
|
INFORMATION AND CONTROL 35, 276--336 (1977) Induction, Pure and Simple
– Peter Kugel
|
|
11
|
Induction, Pure and Simple
– Peter Kugel
- 1977
|
|
|
Self-Monitoring Machines and an
– Hierarchy Of Loops, Mark Changizi
|
|
2
|
Parsimony Hierarchies for Inductive Inference
– Andris Ambainis, John Case, S. Jain, M. Suraj, Sanjay Jain, Mandayam Suraj
|
|
4
|
What is a Universal Higher-Order Programming Language?
– Ramarao Kanneganti, Robert Cartwright
- 1993
|
|
|
Recursion Theory
– Helmut Schwichtenberg
- 2007
|
|
16
|
Higher Order Logic
– Daniel Leivant
- 1994
|
|
1
|
A natural axiomatization of Church’s thesis
– Nachum Dershowitz, Yuri Gurevich
- 2007
|
|
23
|
On Folk Theorems
– David Harel
- 1980
|
