Abstract

The basic concept of Type-2 Theory of Effectivity to define computability on topological spaces or limit spaces are representations, i. e. surjection functions from the Baire space onto X. 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