Abstract

We consider the informal concept of "computability" or "effective calculability" andtwo of the formalisms commonly used to define it, "(Turing) computability" and "(general) recursiveness". We consider their origin, exact technical definition, concepts, history, general English meanings, how they became fixed in their present roles, how they were first and are now used, their impact on nonspecialists, how their use will affect the future content of the subject of computability theory, and its connection to other related areas. After a careful historical and conceptual analysis of computability and recursion we make several recommendations in section 7 about preserving the intensional di#erences between the concepts of "computability" and "recursion." Specifically we recommend that: the term "recursive" should no longer carry the additional meaning of "computable" or "decidable;" functions defined using Turing machines, register machines, or their variants should be calle...

Citations

1151	On Computable Numbers, with an Application to the Entscheidungsproblem - Turing - 1936
687	Introduction to Metamathematics - Kleene - 1971
384	Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Monatshefte für Mathematik und Physik - Gödel - 1931
262	An Unsolvable Problem of Elementary Number Theory - Church - 1936
126	Mathematical thought from ancient to modern times - Kline - 1972
117	Recursively enumerable sets of positive integers and their decision problems - Post - 1944
114	Computability and Unsolvability - Davis - 1958
99	A Note on the Entscheidungsproblem - Church - 1936
82	On notation for ordinal numbers - Kleene - 1938
82	Formal Reduction of the General Combinatorial Decision Problem - Post - 1943
76	W.: Grundzüge der theoretischen Logik - Hilbert, Ackermann - 1928
75	Recursive unsolvability of a problem of Thue - POST - 1947
67	General Recursive Functions of Natural Numbers’, Mathematische Annalen 112 - Kleene - 1936
57	Recursive functionals and quantifiers of finite types - Kleene - 1959
56	Church’s Thesis and Principles of Mechanisms - Gandy - 1980
50	Lambda-definability and recursiveness - Kleene - 1936
44	Recursive predicates and quantifiers - Kleene - 1943
43	On undecidable propositions of formal mathematical systems - Gödel - 1965
43	Computing Machinery and Intelligence," Mind 59 - Turing - 1950
40	Arithmetices principia, nova methodo exposita. Bocca, Turin, 1889. English translation in [18 - Peano
37	The upper semi-lattice of degrees of recursive unsolvability - Kleene, Post - 1954
36	Uber das Unendliche. Mathematische Annalen, 95:161-190,1926. [34] David Hilbert and Paul Bernays. Grundlagen der Mathematik. Grundlehrender Mathematischen Wissenschaften. Springer-Verlag, 2nd edition, 19681970. Volume I - Hilbert - 1987
34	Absolutely Unsolvable Problems and Relatively Undecidable Propositions - Account of an Anticipation - Post - 1965
30	Foundations of Recursion Theory - Platek
24	Formal definitions in the theory of ordinal numbers - Church - 1936
24	Soare, Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets - I - 1987
23	Neubegründung der Mathematik”, Abhandlungen des Mathematischen Seminars Universität Hamburg 1, 157-177; English trans., “The New Grounding of Mathematics”, in Ewald - Hilbert - 1922
23	Recursion on the Countable Functionals - Normann
22	Hierarchies of number-theoretic predicates - Kleene - 1955
18	Turing, Systems of logic based on the ordinals - M - 1939
17	Über die Grundlagen der Logik und der Arithmetik - Hilbert - 1905
16	Arithmetical predicates and function quantifiers - Kleene - 1955
16	Finite combinatory processes—formulation 1 - Post - 1936
15	On the forms of the predicates in the theory of constructive ordinals (second paper - Kleene - 1955
15	Origins of recursive function theory - Kleene - 1981
15	Begründung der elementaren Arithmetik durch die rekurrierende Denkweise ohne Anwendung scheinbarer Verënderlichen mit unendlichem Ausdehnungsbereich - Skolem - 1923
14	The Confluence of Ideas - Gandy - 1988
14	Turing-machine computable functionals of finite types - Kleene - 1962
12	The constructive second number class - Church - 1938
12	Uber eine bisher noch nicht benütze Erweiterung des finiten Standpunktes - Gödel - 1958
12	Degrees of Unsolvability: Local and Global Theory - Lerman
11	Turing’s Analysis of Computability, and Major Applications of It - Kleene - 1988
11	Degrees of recursive unsolvability: preliminary report - Post - 1948
10	Mathematical Logic and the Origin of Modern Computers - Davis - 1987
10	Undecidable diophantine propositions - Gödel - 1995
10	The word problem in semi-groups with cancellation - Turing - 1950
9	Turing: Computability and λ-definability - M - 1937
8	1996a]. Definability, automorphisms, and dynamic properties of computably enumerable sets, Bull. Symbolic Logic 2(2 - Harrington, Soare
8	Alan Turing: the Enigma, Burnett books and - Hodges - 1983
7	Review of Turing (1936 - Church - 1937