Abstract
To study physical the realizability of “computational” procedures, the notion of “inaccessibility” is introduced. As specific examples, the halting set of a universal Turing machine, the Mandelbrot set, and a riddled basin, all of which are defined by decision procedures, are studied. Decision procedures of a halting set of a universal Turing machine and the Mandelbrot set are shown to be inaccessible, that is, the precision of the decision in these procedures cannot be increased asymptotically as the error is decreased to 0. On the other hand, the decision procedure of a riddled basin is shown to have different characteristics regarding (in) accessibility, from the other two instances. The physical realizability of computation models is discussed in terms of the inaccessibility.
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.
