Abstract
The λ-calculus represents a class of (partial) functions (λ-definable functions) on the integers that turns out to be the class of (partial) recursive functions. The equivalence between the Turing computable functions and the general recursive functions was originally proved via the λ-calculus: the general recursive functions are exactly the λ-definable functions as are the Turing computable functions. The equivalence between the λ-definable functions and the recursive functions was one of the arguments used by Church to defend his thesis proposing the identification of the intuitive class of effectively computable functions with the class of recursive functions; in fact one can give arguments for the Church's superthesis that states that for the functions involved this identification preserves the intensional character—that is, process of computation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Studies in Logic and the Foundations of Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
