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

    Bozşahin, Cem 2016. Fundamental Issues of Artificial Intelligence.


    Bucciarelli, A. Carraro, A. Favro, G. and Salibra, A. 2016. Graph easy sets of mute lambda terms. Theoretical Computer Science, Vol. 629, p. 51.


    Xu, Jin 2016. Probe Machine. IEEE Transactions on Neural Networks and Learning Systems, Vol. 27, Issue. 7, p. 1405.


    FU, YUXI 2015. Non-deterministic structures of computation. Mathematical Structures in Computer Science, Vol. 25, Issue. 06, p. 1295.


    Pexton, Mark 2015. Emergence and Fundamentality in a Pancomputationalist Universe. Minds and Machines, Vol. 25, Issue. 4, p. 301.


    Given-Wilson, Thomas 2014. An Intensional Concurrent Faithful Encoding of Turing Machines. Electronic Proceedings in Theoretical Computer Science, Vol. 166, p. 21.


    Velupillai, K.Vela and Kao, Ying-Fang 2014. Computable and computational complexity theoretic bases for Herbert Simon’s cognitive behavioral economics. Cognitive Systems Research, Vol. 29-30, p. 40.


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


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


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


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


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


    Díaz, J. and Torras, C. 2012. A personal account of Turing’s imprint on the development of computer science. Computer Science Review, Vol. 6, Issue. 5-6, p. 225.


    Jones, N. D. and Simonsen, J. G. 2012. Programs=data=first-class citizens in a computational world. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, Vol. 370, Issue. 1971, p. 3305.


    Lescanne, Pierre and Perrinel, Matthieu 2012. “Backward” coinduction, Nash equilibrium and the rationality of escalation. Acta Informatica, Vol. 49, Issue. 3, p. 117.


    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.


    Uttam, Shikhar 2012. Quantum Information Processing and Quantum Error Correction.


    Xiong, L. Tan, Q. and Shao, Z. 2012. Exploration of the effects of soft errors from dynamic software behaviours. IET Software, Vol. 6, Issue. 6, p. 514.


    Endrullis, Jörg Geuvers, Herman Simonsen, Jakob Grue and Zantema, Hans 2011. Levels of undecidability in rewriting. Information and Computation, Vol. 209, Issue. 2, p. 227.


    Gherardi, Guido 2011. Alan Turing and the Foundations of Computable Analysis. Bulletin of Symbolic Logic, Vol. 17, Issue. 03, p. 394.


    ×

Computability and λ-definability

  • A. M. Turing (a1)
  • DOI: http://dx.doi.org/10.2307/2268280
  • Published online: 01 March 2014
Abstract

Several definitions have been given to express an exact meaning corresponding to the intuitive idea of ‘effective calculability’ as applied for instance to functions of positive integers. The purpose of the present paper is to show that the computable functions introduced by the author are identical with the λ-definable functions of Church and the general recursive functions due to Herbrand and Gödel and developed by Kleene. It is shown that every λ-definable function is computable and that every computable function is general recursive. There is a modified form of λ-definability, known as λ-K-definability, and it turns out to be natural to put the proof that every λ-definable function is computable in the form of a proof that every λ-K-definable function is computable; that every λ-definable function is λ-K-definable is trivial. If these results are taken in conjunction with an already available proof that every general recursive function is λ-definable we shall have the required equivalence of computability with λ-definability and incidentally a new proof of the equivalence of λ-definability and λ-K-definability.

A definition of what is meant by a computable function cannot be given satisfactorily in a short space. I therefore refer the reader to Computable pp. 230–235 and p. 254. The proof that computability implies recursiveness requires no more knowledge of computable functions than the ideas underlying the definition: the technical details are recalled in §5.

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.

Alonzo Church , An unsolvable problem of elementary number theory, American journal of mathematics, vol. 58 (1936), pp. 345363

S. C. Kleene , General recursive functions of natural numbers, Mathematische Annalen, vol. 112 (19351936), pp. 727742

S. C. Kleene , λ-definability and recursiveness, Duke mathematical journal, vol. 2 (1936), pp. 340353

Alonzo Church and J. B. Rosser , Some properties of conversion, Transactions of the American Mathematical Society, vol. 39 (1936), pp. 472482

Recommend this journal

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

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×