The Turing closure of an Archimedean field

DOI10.1016/S0304-3975(99)00096-1zbMath0951.68033MaRDI QIDQ1575915

Sebastiano Vigna, Paolo Boldi

Publication date: 23 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

BSS machineType 2 Turing machines

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Computability and recursion theory (03D99)

Related Items

Equality is a jump

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On degrees of recursive unsolvability
• Reducibilities on real numbers
• Type 2 recursion theory
• On the convergence of Newton's method
• \(\delta\)-uniform BSS machines
• Feasible real random access machines
• Equality is a jump
• On degrees of unsolvability
• Countable initial segments of the degrees of unsolvability
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Recursion Theory and Dedekind Cuts
• On Computable Numbers, with an Application to the Entscheidungsproblem