Nonuniform computability conjecture for special fan functionals and Pincherle realisers
Let be a type-three functional satisfying the Pincherle realiser condition , and let be a type-three functional satisfying . Computability is in the S1–S9 sense.
Nonuniform computability conjecture. There is an satisfying such that no satisfying is computable in .
This conjecture captures a proposed fundamental difference between special fan functionals and Pincherle realisers: although the corresponding principles are equivalent in suitable higher-order systems, the functional witnessing the special fan theorem may not be uniformly computable from a Pincherle realiser, even with additional comprehension. The source presents the claim as conjectural and notes that it may be incorrect.
References
Primary source
Dag Normann and Sam Sanders, “Pincherle's theorem in Reverse Mathematics and computability theory”, arXiv:1808.09783 (2020).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.