\(\delta\)-uniform BSS machines

DOI10.1006/jcom.1998.0475zbMath0919.68039OpenAlexW1999405008MaRDI QIDQ1271171

Sebastiano Vigna, Paolo Boldi

Publication date: 11 November 1998

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1998.0475

zbMATH Keywords

Turing model\(\delta\)-uniform decidability

Mathematics Subject Classification ID

Related Items

Feasible real random access machines, The Turing closure of an Archimedean field, Equality is a jump, Computability on subsets of Euclidean space. I: Closed and compact subsets, On approximate and algebraic computability over the real numbers

Cites Work

• Reducibilities on real numbers
• Real functions and numbers defined by Turing machines
• Type 2 recursion theory
• Theory of representations
• Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Recursion Theory and Dedekind Cuts
• Recursive Real Numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item