Abstract
AbstractThe basic concept of Type‐2 Theory of Effectivity (TTE) to define computability on topological spaces (X, τ) or limit spaces (X,→) are representations, i. e. surjection functions from the Baire space ontoX. Representations having the topological property of admissibility are known to provide a reasonable computability theory. In this article, we investigate several additional properties of representations which guarantee that such representations induce a reasonable Type‐2 Complexity Theory on the represented spaces. For each of these properties, we give a nice characterization of the class of spaces that are equipped with a representation having the respective property. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
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.
