Abstract
The objective of this study is a better understandingof the relationships between reduction and continuity. Solovay reduction is a variation of Turing reduction based on the distance of two real numbers. We characterize Solovay reduction by the existence of a certain real function that is computable (in the sense of computable analysis) and Lipschitz continuous. We ask whether thereexists a reducibility concept that corresponds to H¨older continuity. The answer is affirmative. We introduce quasi Solovay reduction and characterize this new reduction via H¨older continuity. In addition, we separate it from Solovay reduction and Turing reduction and investigate the relationships between complete sets and partial randomness.
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.
