Stashing and parallelization pentagons
From MaRDI portal
Publication:5028441
Authors: Vasco Brattka 
Publication date: 9 February 2022
Full work available at URL: https://arxiv.org/abs/2102.11832
Recommendations
computable analysislinear logiccomputability theoryclosure and interior operatorsWeihrauch complexity
Cites Work
- Title not available (Why is that?)
- The Degrees of Hyperimmune Sets
- Weihrauch degrees, omniscience principles and weak computability
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
- Turing computability. Theory and applications
- Computable invariance
- Effective Choice and Boundedness Principles in Computable Analysis
- Effective Borel measurability and reducibility of functions
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
- Closed choice and a uniform low basis theorem
- Degrees of unsolvability of continuous functions
- Game characterizations and lower cones in the Weihrauch degrees
- Title not available (Why is that?)
- Degrees of unsolvability: a tutorial
- On the uniform computational content of computability theory
- On the uniform computational content of the Baire category theorem
- Probabilistic computability and choice
- On the algebraic structure of Weihrauch degrees
- Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
- Weihrauch Complexity in Computable Analysis
- Completion of choice
- Weihrauch goes Brouwerian
- Joins in the strong Weihrauch degrees
- Weakly represented families in reverse mathematics
- Dividing by zero -- how bad is it, really?
Cited In (3)
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)
