Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory

Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory (2009)

Cached

Download Links

[www.people.cs.uchicago.edu]

by Robert I. Soare

Citations:

1 - 0 self

BibTeX

@MISC{Soare09turingoracle,
    author = {Robert I. Soare},
    title = {Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory},
    year = {2009}
}

Bookmark

OpenURL

Abstract

Citations

714	Theory of recursive functions and effective computability, McGraw-Hill - Rogers - 1967
593	Introduction to Metamathematics - Kleene - 1971
308	Uber formal unentscheidbare Satze der Principia Mathematica und verwandter Systeme. Monatshefte fur Mathematik und Physik - Godel - 1931
214	An unsolvable problem of elementary number theory - Church - 1936
155	2002, Computability and Logic - Boolos, Burgess, et al.
106	Recursively enumerable sets of positive integers and their decision problems - Post - 1944
97	Computing Machinery and - Turing - 1950
92	Computability and Unsolvability - Davis - 1958
77	Trial and error predicates and the solution to a problem of Mostowski - Putnam - 1965
74	A note on the Entscheidungsproblem - Church - 1936
68	Formal Reduction of the General Combinatorial Decision Problem - Post - 1943
63	1928], Grundzüge der theoretischen Logik - Hilbert, Ackermann
60	Recursive unsolvability of a problem of Thue - Post - 1947
57	General recursive functions of natural numbers, Mathematische Annalen 112 - Kleene - 1936
51	Recursive functionals and quantifiers of finite types - Kleene - 1959
49	Mathematical logic - Kleene - 1967
44	Two recursively enumerable sets of incomparable degrees of unsolvability - Friedberg - 1957
41	Lambda-definability and recursiveness - Kleene - 1936
38	On undecidable proposition of formal mathematical systems - Gödel - 1934
33	Recursive predicates and quantifiers - Kleene - 1943
32	Über das Unendliche. Mathematische Annalen, 95, 1926 161-190. Translated as ”On the infinite” in van Heijenoort, From Frege to Gödel: A source book in mathematical logic - Hilbert
32	Degrees of Unsolvability - Shoenfield - 1971
32	Computing machinery and intelligence, Mind 59 - Turing - 1950
31	The upper semi-lattice of degrees of recursive unsolvability - Kleene, Post - 1954
30	On the unsolvability of the problem of reducibility in the theory of algorithms - Muchnik - 1956
27	The universal computer: the road from Leibniz to Turing - Davis - 2000
26	Absolutely unsolvable problems and relatively undecidable propositions: account of an anticipation - Post - 1965
24	Soare, Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets - I - 1987
22	Formal definitions in the theory of ordinal numbers - Church, Kleene - 1937
20	Church’s Thesis and Principles for Mechanics,” in The Kleene Symposium - Gandy - 1980
19	Die Grundlagen der Mathematik, Abhandlungen aus dem Mathematischen Seminar der Hamburgischen Universität 6 - Hilbert - 1928
17	Hierarchies of number-theoretic predicates - Kleene - 1955
17	Reflections on Kurt Gödel - Wang - 1988
15	Reducibility and completeness for sets of integers - Friedberg, Rogers - 1959
15	Some basic theorems on the foundations of mathematics and their implications - Gödel - 1951
14	Incomputability in nature - Cooper, Odifreddi - 2003
14	On the forms of the predicates in the theory of constructive ordinals (second paper - Kleene - 1955
14	Arithmetical predicates and function quantifiers - Kleene - 1955
14	Turing, Systems of logic based on ordinals - M - 1939
13	Soare, Computability Theory and Applications - I
12	Über die Grundlagen der Logik und der Arithmetik - Hilbert - 1904
12	Turing-machine computable functionals of finite types - Kleene - 1962
10	The constructive second number class - Church - 1938
9	Undecidable diophantine propositions - Gödel - 1995
9	Turing’s analysis of computability, and major applications of it - Kleene - 1988
9	Degrees of Unsolvability: Local and Global Theory - Lerman - 1983
9	Degrees of recursive unsolvability: preliminary report - Post - 1948
8	Remarks before the Princeton bicentennial conference on problems - Gödel - 1946
8	Eds.): “Interactive Computation: The New Paradigm - Goldin, Smolka, et al. - 2006
8	Turing: Computability and λ-definability - M - 1937