Effectivity in Spaces with Admissible Multirepresentations

The property of admissibility of representations plays an important role in Type–2 Theory of Effectivity (TTE). TTE defines computability on sets with continuum cardinality via representations. Admissibility is known to be indispensable for guaranteeing reasonable effectivity properties of the used representations. The question arises whether every function that is computable with respect to arbritrary representations is also computable with respect to closely related admissible ones. We define three operators which transform (multi–) representations into admissible ones in such a way that relative computability of functions is preserved. Thus the use of admissible (multi–) representations rather than of non–admissible ones does not decrease the class of relatively computable functions.