Pages that link to "Item:Q4921445"
From MaRDI portal
The following pages link to Revising Type-2 Computation and Degrees of Discontinuity (Q4921445):
Displaying 11 items.
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma (Q408156) (← links)
- Closed choice and a uniform low basis theorem (Q424541) (← links)
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra (Q424551) (← links)
- A topological view on algebraic computation models (Q1679677) (← links)
- Probabilistic computability and choice (Q2346414) (← links)
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism (Q2637708) (← links)
- Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract) (Q2946357) (← links)
- Alan Turing and the Foundations of Computable Analysis (Q3174639) (← links)
- (Q4585068) (← links)
- Weihrauch Complexity in Computable Analysis (Q5024577) (← links)
- On the topological aspects of the theory of represented spaces (Q5740207) (← links)
