\(\mu\)-recursion and infinite limits.
From MaRDI portal
Publication:1401321
DOI10.1016/S0304-3975(02)00744-2zbMath1044.68056MaRDI QIDQ1401321
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
The elementary computable functions over the real numbers: applying two new techniques ⋮ A survey of recursive analysis and Moore's notion of real computation ⋮ The P\(\neq\) NP conjecture in the context of real and complex analysis ⋮ Real recursive functions and their hierarchy ⋮ Analog computation beyond the Turing limit ⋮ Computability on reals, infinite limits and differential equations ⋮ Abstract geometrical computation. III: Black holes for classical and analog computing ⋮ A new conceptual framework for analog computation ⋮ A foundation for real recursive function theory ⋮ Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
Cites Work
- Unnamed Item
- Recursion theory on the reals and continuous-time computation
- The extended analog computer
- On degrees of unsolvability
- On the definitions of computable real continuous functions
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
This page was built for publication: \(\mu\)-recursion and infinite limits.
