Abstract
The connection between index stes appearing in recursive enumerations of subrecursive classes and translating functions is investigated. Referring to a construction, which yields enumerations with low complexity for some index sets, we show that in such a case the complexity for some translating functions must be high. Furthermore a class of enumerations is discussed, which has elementary translating functions, but an important part of the index sets is not decidable by algorithms of the enumerated class (these index sets are of the form { x : ψ x ( a ) = f ( x )}).
Published Version
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.
