RELATIONSHIPS BETWEEN DIFFERENT FORMS OF RELATIVE COMPUTABILITY OF FUNCTIONS

DOI10.1070/SM1979V035N03ABEH001545MaRDI QIDQ3863868zbMATH OpenOpenAlexFDO

Authors E. A. Polyakov, M. G. Rozinas

Publication date 1979

Published in Mathematics of the USSR-Sbornik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1070/sm1979v035n03abeh001545

zbMATH Keywords

potential recursive functionsreducibilitiesrelative computable functions

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cited in

(2)

• Bounded query classes and the difference hierarchy
• Bounded enumeration reducibility and its degree structure

This page was built for publication: RELATIONSHIPS BETWEEN DIFFERENT FORMS OF RELATIVE COMPUTABILITY OF FUNCTIONS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3863868)