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

1080	On computable numbers, with an application to the entscheidungsproblem - Turing - 1936
659	Introduction to Metamathematics - Kleene - 1952
368	formal unentscheidbare Satze der Principia Mathematica und venvandter Systeme I,” Monatshefte fur Mathematik und Physik - “Uber - 1931
249	An unsolvable problem of elementary number theory - Church - 1936
118	Mathematical Thought from Ancient to Modern Times - Kline - 1972
117	Recursively enumerable sets of positive integers and their decision problems - Post - 1944
104	Computability and Unsolvability - Davis - 1985
95	A note on the Entscheidungsproblem - Church - 1936
77	Formal reductions of the general combinatorial decision problem - Post - 1943
76	On a Notation for Ordinal Numbers - Kleene - 1981
71	Grundzüge der theoretischen Logik - Hilbert, Ackermann - 1928
71	Recursive unsolvability of a problem of Thue - Post - 1947
64	General Recursive Functions of Natural Numbers - Kleene - 1936
56	Recursive functionals and quantifiers of finite types - Kleene - 1959
52	Church’s thesis and principles for mechanisms - Gandy - 1980
48	λ-definability and recursiveness - Kleene - 1936
42	On undecidable propositions of formal mathematical systems - Gödel - 1934
42	Arithmetices principia, nova methodo exposita. Bocca, Torino. Quoted after the English translation in (van Heijenoort - Peano - 1889
40	Computing machinery and intelligence.” Mind 59 - Turing - 1950
38	Recursive predicates and quantifiers - Kleene - 1943
36	Über das Unendliche, Mathematische Annalen 95 - Hilbert - 1926
35	The upper semi-lattice of degrees of recursive unsolvability - Kleene, Post - 1972
30	Foundations of Recursion Theory - Platek
27	Absolutely Unsolvable Problems and Relatively Undecidable Propositions: Account of an Anticipation - Post - 1994
24	Formal definitions in the theory of ordinal numbers, Fund - Church, Kleene - 1936
24	Soare, Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets - I - 1987
22	1928]: 'Die Grundlagen der Mathematik', Abhandlungen aus dem mathematischen Seminar der Hamburgischen Universitat 6 - HILBERT
22	Recursion on the countable functionals - Normann - 1980
21	Hierarchies of number-theoretical predicates - Kleene - 1955
16	Arithmetical predicates and function quantifiers - Kleene - 1955
16	Finite combinatory processes—formulation 1 - Post - 1936
16	Systems of Logic Based on Ordinals - unknown authors - 1939
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
14	Turing-machine computable functionals of finite types - Kleene - 1962
14	Begründung der elementaren Arithmetik durch die rekurrierende Denkweise ohne Anwendung scheinbarer Veränderlichen mit unendlichem Ausdehnungsbereich. Skrifter, Norske Videnskaps-Akademi i Oslo (= Videnskapsselskapet i Kristiania), Matematisk-Naturvidenska - Skolem - 1923
13	The Confluence of Ideas in - Gandy - 1995
13	Uber die Grundlagen der Logik und der Arithmik - Hilbert - 1904
11	The constructive second number class - Church - 1938
11	Über eine bisher noch nicht benütze Erweiterung des finiten Standpunktes, Dialectica 12 - Gödel - 1958
11	Degrees of recursive unsolvability: Preliminary report (abstract - Post - 1948
10	Undecidable diophantine propositions - Gödel - 1995
10	Turing’s analysis of computability, and major applications of it - Kleene - 1988
10	Degrees of Unsolvability: Local and Global Theory - Lerman - 1983
10	The word problem for semigroups with cancellation - TURING - 1950
9	Mathematical logic and the origin of modern computers - Davis - 1988
8	Soare, Definability, automorphisms, and dynamic properties of computably enumerable sets - Harrington, I - 1996
8	Alan Turing: the Enigma, Burnett books and - Hodges - 1983
8	Turing: Computability and λ-definability - M - 1937
6	Review of Turing 1936 - Church - 1937