Abstract
An ordinal hierarchy of recursive functions is developed based on the level to which a function requires a machine computing it to monitor and make decisions concerning itself. The major theorem states that the functions with self-monitoring level belowωωare precisely the class of loop functions (or primitive recursive functions).
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 callDisclaimer: 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.
