Stashing and parallelization pentagons
From MaRDI portal
Recommendations
Cites work
- Closed choice and a uniform low basis theorem
- Completion of choice
- Computable invariance
- Degrees of unsolvability of continuous functions
- Degrees of unsolvability: a tutorial
- Dividing by zero -- how bad is it, really?
- Effective Borel measurability and reducibility of functions
- Effective Choice and Boundedness Principles in Computable Analysis
- Game characterizations and lower cones in the Weihrauch degrees
- scientific article; zbMATH DE number 1962830 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
- Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
- Joins in the strong Weihrauch degrees
- On the algebraic structure of Weihrauch degrees
- On the uniform computational content of computability theory
- On the uniform computational content of the Baire category theorem
- Probabilistic computability and choice
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
- The Degrees of Hyperimmune Sets
- Turing computability. Theory and applications
- Weakly represented families in reverse mathematics
- Weihrauch Complexity in Computable Analysis
- Weihrauch degrees, omniscience principles and weak computability
- Weihrauch goes Brouwerian
Cited in
(4)
This page was built for publication: Stashing and parallelization pentagons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5028441)
