On the complexity of online computations of real functions
From MaRDI portal
Publication:1186506
DOI10.1016/0885-064X(91)90026-TzbMath0768.68064MaRDI QIDQ1186506
Publication date: 28 June 1992
Published in: Journal of Complexity (Search for Journal in Brave)
Turing machinescomputational complexity for real functionsinput lookaheadmodified infinite binary representations
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Fast online multiplication of real numbers ⋮ Computability on computable metric spaces ⋮ A refined model of computation for continuous problems ⋮ Feasible real random access machines ⋮ Online computations of differentiable functions ⋮ Unnamed Item
Cites Work
- Type 2 recursion theory
- Theory of representations
- Computing with infinite objects
- Computational complexity of real functions
- Type 2 computational complexity of functions on Cantor's space
- Fast Multiple-Precision Evaluation of Elementary Functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the complexity of online computations of real functions
