Quasi-completeness and functions without fixed-points

DOI10.1002/MALQ.200610017zbMATH Open1110.03026OpenAlexW2020001584MaRDI QIDQ3418089FDOQ3418089

Authors: I. I. Batyrshin 

Publication date: 2 February 2007

Published in: MLQ (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.200610017

Recommendations

• scientific article; zbMATH DE number 4125390
• Fixed-point selection functions
• scientific article; zbMATH DE number 4012595
• scientific article; zbMATH DE number 3557768
• Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion

zbMATH Keywords

computabilityarithmetical hierarchyprefix-free Kolmogorov complexityquasi-reducibilityfunctions without fixed-points

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other Turing degree structures (03D28) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited In (7)

• Irreducible, singular, and contiguous degrees
• Fixed-point selection functions
• \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets
• Bounds on Quasi-Completeness
• Completeness criteria for a class of reducibilities
• The noneffectivity of Arslanov's completeness criterion and related theorems
• On a general method of constructing post reducibilities and the corresponding completeness criteria

This page was built for publication: Quasi-completeness and functions without fixed-points

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