Skip to main content
×
Home
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 43
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    2016. Algebraic Computability and Enumeration Models.


    Rescorla, Michael 2015. The Representational Foundations of Computation. Philosophia Mathematica, Vol. 23, Issue. 3, p. 338.


    Lobina, David J. 2014. What linguists are talking about when talking about…. Language Sciences, Vol. 45, p. 56.


    Lobina, David J. 2014. When linguists talk mathematical logic. Frontiers in Psychology, Vol. 5,


    Lobina, David J. 2014. Probing recursion. Cognitive Processing, Vol. 15, Issue. 4, p. 435.


    Nayebi, Aran 2014. Practical Intractability: A Critique of the Hypercomputation Movement. Minds and Machines, Vol. 24, Issue. 3, p. 275.


    Cooper, S. Barry and Leeuwen, Jan Van 2013. Alan Turing: His Work and Impact.


    De Araujo, A. and Carnielli, W. 2012. Non-standard numbers: a semantic obstacle for modelling arithmetical reasoning. Logic Journal of IGPL, Vol. 20, Issue. 2, p. 477.


    Fitch, W. T. Friederici, A. D. and Hagoort, P. 2012. Pattern perception and computational complexity: introduction to the special issue. Philosophical Transactions of the Royal Society B: Biological Sciences, Vol. 367, Issue. 1598, p. 1925.


    Horsten, L. 2012. Vom Zahlen zu den Zahlen: On the Relation Between Computation and Arithmetical Structuralism. Philosophia Mathematica, Vol. 20, Issue. 3, p. 275.


    Horsten, L. 2012. Vom Zahlen zu den Zahlen: On the Relation Between Computation and Arithmetical Structuralism. Philosophia Mathematica, Vol. 20, Issue. 3, p. 275.


    Petersson, Karl-Magnus Folia, Vasiliki and Hagoort, Peter 2012. What artificial grammar learning reveals about the neurobiology of syntax. Brain and Language, Vol. 120, Issue. 2, p. 83.


    Petersson, K. M. and Hagoort, P. 2012. The neurobiology of syntax: beyond string sets. Philosophical Transactions of the Royal Society B: Biological Sciences, Vol. 367, Issue. 1598, p. 1971.


    Soare, R. I. 2012. Formalism and intuition in computability. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, Vol. 370, Issue. 1971, p. 3277.


    Chitaia, Irakli O. Omanadze, Roland Sh. and Sorbi, Andrea 2011. Immunity properties and strong positive reducibilities. Archive for Mathematical Logic, Vol. 50, Issue. 3-4, p. 341.


    Fresco, Nir 2011. Concrete Digital Computation: What Does it Take for a Physical System to Compute?. Journal of Logic, Language and Information, Vol. 20, Issue. 4, p. 513.


    Lobina, David J. 2011. Recursion and the competence/performance distinction in AGL tasks. Language and Cognitive Processes, Vol. 26, Issue. 10, p. 1563.


    Tomalin, Marcus 2011. Syntactic Structures and Recursive Devices: A Legacy of Imprecision. Journal of Logic, Language and Information, Vol. 20, Issue. 3, p. 297.


    Urbaniak, R. 2011. How Not To Use the Church-Turing Thesis Against Platonism. Philosophia Mathematica, Vol. 19, Issue. 1, p. 74.


    Urbaniak, R. 2011. How Not To Use the Church-Turing Thesis Against Platonism. Philosophia Mathematica, Vol. 19, Issue. 1, p. 74.


    ×

Computability and Recursion

  • Robert I. Soare (a1)
  • DOI: http://dx.doi.org/10.2307/420992
  • Published online: 15 January 2014
Abstract
Abstract

We consider the informal concept of “computability” or “effective calculability” and two 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 differences 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 called “computable” rather than “recursive;” we should distinguish the intensional difference between Church's Thesis and Turing's Thesis, and use the latter particularly in dealing with mechanistic questions; the name of the subject should be “Computability Theory” or simply Computability rather than “Recursive Function Theory.”

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

[Church, 1936] A. Church , An unsolvable problem of elementary number theory, American Journal of Mathematics, vol. 58, pp. 345363.

[Church, 1936 b] A. Church , A note on the Entscheidungsproblem, Journal of Symbolic Logic, vol. 1, pp. 4041, correction 101–102.

[Church, 1937] A. Church , Review of Turing 1936, Journal of Symbolic Logic, vol. 2, no. 1, pp. 4243.

[Church, 1937 b] A. Church , Review of Post 1936, Journal of Symbolic Logic, vol. 2, no. 1, p. 43.

[Church, 1938] A. Church , The constructive second number class, Bulletin of the American Mathematical Society, vol. 44, pp. 224232.

[Davis, 1982] M. Davis , Why Gödel did not have Church's thesis, Information and Control, vol. 54, pp. 324.

[Gandy, 1980] R. Gandy , Church's thesis and principles for mechanisms, The Kleene symposium, North-Holland, pp. 123148.

[Gödel, 1958] K. Gödel , Über eine bisher noch nicht benütze Erweiterung des finiten Standpunktes, Dialectica, vol. 12, pp. 280287, German and English translation in Godel 1986, pp. 240–251, with introductory note by A. S. Troelstra, pp. 217–241.

[Hilbert, 1918] D. Hilbert , Axiomatisches Denken, Mathematische Annalen, vol. 78, pp. 405415.

[Hilbert, 1926] D. Hilbert , Über das Unendliche, Mathematische Annalen, vol. 95, pp. 161190, English translation in van Heijenoort 1967, 367–392.

[Kleene, 1936] S. C. Kleene , General recursive functions of natural numbers, Mathematische Annalen, vol. 112, pp. 727742.

[Kleene, 1936 b] S. C. Kleene , λ-definability and recursiveness, Duke Mathematics Journal, vol. 2, pp. 340353.

[Kleene, 1936 c] S. C. Kleene , A note on recursive functions, Bulletin of the American Mathematical Society, vol. 42, pp. 544546.

[Kleene, 1943] S. C. Kleene , Recursive predicates and quantifiers, Transactions of the American Mathematical Society, vol. 53, pp. 4173.

[Kleene, 1944] S. C. Kleene , On the forms of the predicates in the theory of constructive ordinals, American Journal of Mathematics, vol. 66, pp. 4158.

[Kleene, 1955] S. C. Kleene , Arithmetical predicates and function quantifiers, Transactions of the American Mathematical Society, vol. 79, pp. 312340.

[Kleene, 1955 b] S. C. Kleene , On the forms of the predicates in the theory of constructive ordinals (second paper), American Journal of Mathematics, vol. 77, pp. 405428.

[Kleene, 1955 c] S. C. Kleene , Hierarchies of number-theoretical predicates, Bulletin of the American Mathematical Society, vol. 61, pp. 193213.

[Kleene, 1959] S. C. Kleene , Recursive functionals and quantifiers of finite type I, Transactions of the American Mathematical Society, vol. 91, pp. 152.

[Kleene, 1963] S. C. Kleene , Recursive functionals and quantifiers offinite type II, Transactions of the American Mathematical Society, vol. 108, pp. 106142.

[Kleene, 1981] S. C. Kleene , Origins of recursive function theory, Annals of the History of Computing, vol. 3, pp. 5267.

[Kleene, 1981 b] S. C. Kleene , The theory of recursive functions, approaching its centennial, Bulletin of the American Mathematical Society (n.s.), vol. 5, pp. 4361.

[Kleene, 1987] S. C. Kleene , Reflections on Church's Thesis, Notre Dame Journal of Formal Logic, vol. 28, pp. 490498.

[Lerman, 1983] M. Lerman , Degrees of unsolvability: Local and global theory, Springer-Verlag, Heidelberg, New York, Tokyo.

[Normann, 1980] D. Normann , Recursion on countable functionals, Lecture notes in mathematics, no. 811, Springer-Verlag, Heidelberg, New York.

[Peter, 1934] R. Péter , Über den Zussammenhang der verschiedenen Begriffe der rekursiven Funktion, Mathematische Annalen, vol. 110, pp. 612632.

[Post, 1943] E. L. Post , Formal reductions of the general combinatorial decision problem, American Journal of Mathematics, vol. 65, pp. 197215.

[Post, 1944] E. L. Post , Recursively enumerable sets of positive integers and their decision problems, Bulletin of the American Mathematical Society, vol. 50, pp. 284316, reprinted in Davis 1965, pp. 304–337.

[Putnam, 1995] H. Putnam , Review of Penrose 1994, Bulletin of the American Mathematical Society, vol. 32, pp. 370373.

[Sacks, 1990] G. E. Sacks , Higher recursion theory, Springer-Verlag, Heidelberg, New York.

[Soare, 1987] R. I. Soare , Recursively enumerable sets and degrees: A study of computable functions and computably generated sets, Springer-Verlag, Heidelberg.

[Turing, 1950 b] A. M. Turing , The word problem in semi-groups with cancellation, Annals of Mathematics, vol. 52, pp. 491505.

[Zabell, 1995] S. L. Zabell , Alan Turing and the central limit theorem, American Mathematical Monthly, vol. 102, no. 6, pp. 483494.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Bulletin of Symbolic Logic
  • ISSN: 1079-8986
  • EISSN: 1943-5894
  • URL: /core/journals/bulletin-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×