The Turing closure of an Archimedean field
From MaRDI portal
Recommendations
Cites work
- \(\delta\)-uniform BSS machines
- Countable initial segments of the degrees of unsolvability
- Equality is a jump
- Feasible real random access machines
- 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?)
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On Computable Numbers, with an Application to the Entscheidungsproblem
- 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
Cited in
(4)
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)