Author:
Brattka Vasco,Hendtlass Matthew,Kreuzer Alexander P.
Reference38 articles.
1. [15] Brattka, V., and A. Pauly, “On the algebraic structure of Weihrauch degrees,” preprint, arXiv:1604.08348v7 [cs.LO].
2. [36] Weihrauch, K., “The degrees of discontinuity of some translators between representations of the real numbers,” technical report TR-92-050, International Computer Science Institute, Berkeley, Calif., 1992, http://www.icsi.berkeley.edu/pubs/techreports/tr-92-050.pdf.
3. [1] Avigad, J., E. T. Dean, and J. Rute, “Algorithmic randomness, reverse mathematics, and the dominated convergence theorem,” Annals of Pure and Applied Logic, vol. 163 (2012), pp. 1854–64.
4. [2] Barmpalias, G., A. R. Day, and A. E. M. Lewis-Pye, “The typical Turing degree,” Proceedings of the London Mathematical Society (3), vol. 109 (2014), pp. 1–39.
5. [3] Bienvenu, L., and L. Patey, “Diagonally non-computable functions and fireworks,” Information and Computation, vol. 253 (2017), pp. 64–77.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. COMPARING COMPUTABILITY IN TWO TOPOLOGIES;The Journal of Symbolic Logic;2023-03-27
2. Stashing And Parallelization Pentagons;Logical Methods in Computer Science;2021-12-20
3. Completion of choice;Annals of Pure and Applied Logic;2021-03
4. Open sets in computability theory and reverse mathematics;Journal of Logic and Computation;2020-10-02
5. Connected choice and the Brouwer fixed point theorem;Journal of Mathematical Logic;2019-06