Kleene’s Amazing Second Recursion Theorem (Extended Abstract)

Cached

Download Links

by Yiannis N. Moschovakis
Citations:1 - 1 self

Active Bibliography

4 Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory – Robert I. Soare - 2009
32 Computability and recursion – Robert I. Soare - 1996
5 The history and concept of computability – Robert I. Soare - 1999
4 Alan Turing and the Mathematical Objection – Gualtiero Piccinini - 2003
Church’s Thesis – Guram Bezhanishvili
2 Historical Projects in Discrete Mathematics and Computer Science – Janet Barnett, Guram Bezhanishvili, Hing Leung, Jerry Lodder, David Pengelley, Desh Ranjan
2 Levels of Undecidability in Rewriting – Jörg Endrullis , Herman Geuvers , Jakob Grue Simonsen , Hans Zantema - 2011
12 Notions of computability at higher types I – John Longley - 2005
18 Thinking May Be More Than Computing – Peter Kugel - 1986
3 Computability and Incomputability – Robert I. Soare
Models of Hypercomputation – Erman Acar - 2012
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
14 Induction, Pure and Simple – Peter Kugel - 1977
Computability and analysis: the legacy of Alan Turing – Jeremy Avigad, Vasco Brattka - 2012
2 Parsimony Hierarchies for Inductive Inference – Andris Ambainis, John Case, S. Jain, M. Suraj, Sanjay Jain, Mandayam Suraj
Self-Monitoring Machines and an – Hierarchy Of Loops, Mark Changizi