Abstract
This chapter discusses the concept of relative computability. The concept of relative computability first appeared in a 1939 paper by Alan Turing. At first glance, it might seem strange to combine the rather constructive concept of computability with the almost mystical idea of an oracle. It is to Turing's credit that he perceived that the combination, strange or not, would be a useful tool in classifying the noncomputable sets. The focus is on an informal description of the concept of effective calculability relative to a set. The plan is to make the concept into a genuine mathematical concept in two ways: general recursiveness relatives and register-machine computability relatives. Further, enumeration theorem and normal form theorem related to relative Computability is discussed followed by equivalence relations
Sign-in/Register to access full text options 
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.
