Generalized computations over regular enumerations

DOI10.1007/BF02218727zbMath0293.02031MaRDI QIDQ1211984

N. V. Belyakin

Publication date: 1975

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/186815

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory (03D99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Hierarchies of computability and definability (03D55)

Cites Work

• Recursive Functionals and Quantifiers of Finite Types I
• Hyperanalytic Predicates
• Unnamed Item

This page was built for publication: Generalized computations over regular enumerations