The Turing closure of an Archimedean field

DOI10.1016/S0304-3975(99)00096-1MaRDI QIDQ1575915zbMATH OpenFDO

Authors Paolo Boldi, Sebastiano Vigna

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)

Recommendations

• scientific article; zbMATH DE number 1390084
• \(\delta\)-uniform BSS machines
• Strong Turing degrees for additive BSS RAM's
• scientific article; zbMATH DE number 1746041

Cites work

• scientific article; zbMATH DE number 3987247 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 3349977 (Why is no real title available?)
• Countable initial segments of the degrees of unsolvability
• Equality is a jump
• Feasible real random access machines
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On degrees of recursive unsolvability
• On degrees of unsolvability
• On the convergence of Newton's method
• Recursion Theory and Dedekind Cuts
• Reducibilities on real numbers
• Type 2 recursion theory
• \(\delta\)-uniform BSS machines

Cited in

(3)

• Cellular automata and \(\delta\)-uniform BSS machines
• Equality is a jump
• TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS

This page was built for publication: The Turing closure of an Archimedean field

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575915)