The degree-spectrum characterization of successor recoverability for computable block functions
The degree-spectrum characterization of successor recoverability for computable block functions
Let be a computable block function on , and consider the degree spectrum of on . The successor is recoverable from on when it can be computed from in the relevant presentation.
Degree-spectrum conjecture. If the degree spectrum of on is equal to all c.e. degrees, then the successor is recoverable from on .
This would extend the equivalence between the c.e.-degree-spectrum property and successor recoverability beyond the classes covered by the paper's main theorem, to all computable block functions. The source does not state a resolution, so the conjecture remains open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Nikolay Bazhenov and Dariusz Kalociński, “Relatively acceptable notation”, arXiv:2205.00791 (2022).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.