Abstract
This chapter discusses four test problems in generalized recursion theory (GRT). All recursion theory is concerned with computations in which individuals are manipulated by some sort of abstract computing engine. However, the principle of parity demands that the computation be of approximately the same complexity as the individuals. This means in practice that a particular kind of recursion theory is often determined completely by its domain of individuals. For example, in classical recursion theory (CRT), the domain of individuals is ω and this fact dictates the nature of the computations. The relations among the four kinds of GRT as well as CRT are also explained in the chapter. The chapter also discusses the basic notions of recursion theory as they apply to each kind of GRT.
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.
