The following pages link to (Q5848892):
Displaying 18 items.
- Notes on computable analysis (Q519888) (← links)
- Curves that must be retraced (Q550254) (← links)
- Borel complexity and computability of the Hahn-Banach theorem (Q926175) (← links)
- Feasible real random access machines (Q1279912) (← links)
- Index sets in computable analysis (Q1292400) (← links)
- Markov's constructive analysis; a participant's view (Q1292407) (← links)
- On the information carried by programs about the objects they compute (Q1693999) (← links)
- Computable total functions on metric algebras, universal algebraic specifications and dynamical systems (Q1764798) (← links)
- Efficient exact computation of iterated maps (Q1779563) (← links)
- An analog characterization of the Grzegorczyk hierarchy (Q1872639) (← links)
- On the time complexity of partial real functions (Q1977153) (← links)
- Algorithmic randomness and Fourier analysis (Q2000003) (← links)
- A Computability Challenge: Asymptotic Bounds for Error-Correcting Codes (Q2891310) (← links)
- How Incomputable is the Separable Hahn-Banach Theorem? (Q4918007) (← links)
- Effective Symbolic Dynamics (Q4918032) (← links)
- On Computable Metrization (Q4921450) (← links)
- Three topological reducibilities for discontinuous functions (Q5046178) (← links)
- Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing (Q6182782) (← links)
