Abstract
We study the principle of positive choice in the Weihrauch degrees. In particular, we study its behaviour under composition and jumps, and answer three questions asked by Brattka, Gherardi and Hölzl.
The research of the second author was supported by John Templeton Foundation grant 15619: ‘Mind, Mechanism and Mathematics: Turing Centenary Research Project’.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Our definition is not exactly the same as the definition of \(\mathrm {C}_{\omega }\) in Brattka, Gherardi and Hölzl [3], but it is easily seen to be strongly Weihrauch-equivalent to it.
- 2.
They do not explicitly state the strong Weihrauch equivalence, but it follows directly from their proof.
References
Bienvenu, L., Greenberg, N., Monin, B.: Continuous higher randomness. http://homepages.mcs.vuw.ac.nz/~greenberg/Papers
Brattka, V., Gherardi, G.: Weihrauch degrees, omniscience principles and weak computability. J. Symbolic Logic 76(1), 143–176 (2011)
Brattka, V., Gherardi, G., Hölzl, R.: Probabilistic computability and choice. Inf. Comput. 242, 249–286 (2015)
Brattka, V., Gherardi, G., Marcone, A.: The Bolzano-Weierstrass theorem is the jump of weak König’s lemma. Ann. Pure Appl. Logic 163, 623–655 (2012)
Brattka, V., Hendtlass, M., Kreuzer, A.P.: On the uniform computational content of computability theory. http://arxiv.org/pdf/1501.00433v3.pdf
Brattka, V., Pauly, A.: On the algebraic structure of Weihrauch degrees. http://arxiv.org/pdf/1604.08348v1.pdf
Brattka, V., Pauly, A.: Computation with advice. In: Zheng, X., Zhong, N. (eds.) CCA 2010, Proceedings of the Seventh International Conference on Computability and Complexity in Analysis, Electronic Proceedings in Theoretical Computer Science, pp. 41–55 (2010)
Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Theory and Applications of Computability. Springer, Heidelberg (2010)
Nies, A.: Computability and Randomness. Oxford Logic Guides. Oxford University Press, Oxford (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Bienvenu, L., Kuyper, R. (2017). Parallel and Serial Jumps of Weak Weak König’s Lemma. In: Day, A., Fellows, M., Greenberg, N., Khoussainov, B., Melnikov, A., Rosamond, F. (eds) Computability and Complexity. Lecture Notes in Computer Science(), vol 10010. Springer, Cham. https://doi.org/10.1007/978-3-319-50062-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-50062-1_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-50061-4
Online ISBN: 978-3-319-50062-1
eBook Packages: Computer ScienceComputer Science (R0)