Relatively recursive reals and real functions
From MaRDI portal
Publication:1274809
DOI10.1016/S0304-3975(98)00098-XzbMath0912.68034MaRDI QIDQ1274809
Publication date: 12 January 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Randomness and reducibility ⋮ Singular coverings and non‐uniform notions of closed set computability ⋮ The approximation structure of a computably approximable real ⋮ On 0′-computable reals ⋮ Complexity of Blowup Problems ⋮ Singular Coverings and Non-Uniform Notions of Closed Set Computability ⋮ Revising Type-2 Computation and Degrees of Discontinuity ⋮ On the hierarchies of Δ20-real numbers ⋮ Relative randomness and real closed fields ⋮ Unnamed Item ⋮ Relatively recursive reals and real functions ⋮ Presentations of computably enumerable reals.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational complexity of real functions
- Relatively recursive reals and real functions
- Beyond recursive real functions
- A recursive function, defined on a compact interval and having a continuous derivative that is not recursive
- Computable functionals
- On computable sequences
- On the definitions of computable real continuous functions
- On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
- Recursive Real Numbers