Abstract
It has been shown that every general recursive function is definable by application of the five schemata for primitive recursive functions together with the schemasubject to the condition that, for each n–tuple of natural numbers x1,…, xn there exists a natural number xn+1 such that
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: Mathematical Proceedings of the Cambridge Philosophical Society
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.
