Equality is a jump
From MaRDI portal
Publication:1292397
DOI10.1016/S0304-3975(98)00283-7zbMATH Open0916.68050OpenAlexW2029807875MaRDI QIDQ1292397FDOQ1292397
Publication date: 21 June 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00283-7
Recommendations
- An explicit solution to Post's problem over the reals
- Fundamentals of Computation Theory
- \(\delta\)-uniform BSS machines
- Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine
- Remarks on \(\Sigma\)-definability without the equality test over the reals
Cites Work
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On degrees of unsolvability
- Classical recursion theory. Vol. II
- Theory of representations
- Recursion Theory and Dedekind Cuts
- Reducibilities on real numbers
- Type 2 recursion theory
- \(\delta\)-uniform BSS machines
- The Turing closure of an Archimedean field
Cited In (5)
This page was built for publication: Equality is a jump
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292397)