A hierarchy below the halting problem for additive machines
From MaRDI portal
Publication:1015375
DOI10.1007/s00224-007-9020-yzbMath1166.68017OpenAlexW2116191550MaRDI QIDQ1015375
Publication date: 8 May 2009
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-007-9020-y
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Computing over the reals with addition and order
- Computing over the reals with addition and order: Higher complexity classes
- An explicit solution to Post's problem over the reals
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Fundamentals of Computation Theory
- Recursively enumerable sets of positive integers and their decision problems
- Logical Approaches to Computational Barriers
- Unnamed Item
This page was built for publication: A hierarchy below the halting problem for additive machines
