Abstract
In this chapter we introduce the formal definitions of computational complexity of real functions. We first review the definitions of computable real numbers and computable real functions and their basic properties. Then, the oracle Turing machine is introduced as the formal model for computing real functions. This model allows us to define the complexity measures for computing real functions in a natural way. The class of polynomial time computable real functions is then defined, and several characterizations of this class will be given. Other complexity classes of real numbers and real functions, such as NP real functions and log-space computable real functions, will be defined in later chapters.
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.
