Effectively infinite classes of numberings and computable families of reals

DOI10.3233/com-230461MaRDI QIDQ6146823

M. Kh. Fajzrakhmanov, Unnamed Author

Publication date: 31 January 2024

Published in: Computability (Search for Journal in Brave)

zbMATH Keywords

computable numberingpositive numberingFriedberg numberingeffective infinityleft-c.e. real

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An easy priority-free proof of a theorem of Friedberg
• Some effectively infinite classes of enumerations
• Limitwise monotonic spectra and their generalizations
• Turing Computability
• Algorithmic Randomness and Complexity
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Theorie der Numerierungen I
• Limitwise monotonic sets of reals
• η-representation of sets and degrees
• Creative sets
• [Russian Text Ignored]
• Effectively infinite classes of numberings of computable families of reals
• A local version of the Slaman-Wehner theorem and families closed under finite differences

This page was built for publication: Effectively infinite classes of numberings and computable families of reals