Fixed-point selection functions

DOI10.1134/S1995080221040041zbMath1491.03030OpenAlexW3165963906MaRDI QIDQ2030128

Marat M. Arslanov

Publication date: 7 June 2021

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080221040041

zbMATH Keywords

reducibilityKolmogorov complexityarithmetical hierarchyrecursion theoremprecomplete numberingfixed-point free function

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (1)

On the main scientific achievements of Victor Selivanov

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completeness in the arithmetical hierarchy and fixed points
• The noneffectivity of Arslanov's completeness criterion and related theorems
• Fixed point theorems for precomplete numberings
• \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets
• Kolmogorov complexity and the Recursion Theorem
• Quasi-completeness and functions without fixed-points
• Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
• A fixed-point-free minimal degree
• GENERALIZATIONS OF THE RECURSION THEOREM
• Π10 classes, strong minimal covers and hyperimmune-free degrees

This page was built for publication: Fixed-point selection functions