Pages that link to "Item:Q2642906"
From MaRDI portal
The following pages link to Real hypercomputation and continuity (Q2642906):
Displaying 15 items.
- Fluctuations, effective learnability and metastability in analysis (Q392289) (← 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)
- Representation theorems for analytic machines and computability of analytic functions (Q693052) (← 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)
- How constructive is constructing measures? (Q2987777) (← links)
- Towards Computational Complexity Theory on Advanced Function Spaces in Analysis (Q3188250) (← links)
- Computability of Analytic Functions with Analytic Machines (Q3576057) (← links)
- (Q4585068) (← links)
- A comparison of concepts from computable analysis and effective descriptive set theory (Q4593238) (← links)
- Weihrauch Complexity in Computable Analysis (Q5024577) (← links)
- On the topological aspects of the theory of represented spaces (Q5740207) (← links)
