Equality is a jump

DOI10.1016/S0304-3975(98)00283-7MaRDI QIDQ1292397zbMATH OpenOpenAlexFDO

Authors Paolo Boldi, Sebastiano Vigna

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

zbMATH Keywords

degree of unsolvability

Mathematics Subject Classification ID

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

• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 217454 (Why is no real title available?)
• scientific article; zbMATH DE number 858680 (Why is no real title available?)
• scientific article; zbMATH DE number 3349977 (Why is no real title available?)
• Classical recursion theory. Vol. II
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On degrees of unsolvability
• Recursion Theory and Dedekind Cuts
• Reducibilities on real numbers
• The Turing closure of an Archimedean field
• Theory of representations
• Type 2 recursion theory
• \(\delta\)-uniform BSS machines

Cited in

(5)

• On Σ‐definability without equality over the real numbers
• The Turing closure of an Archimedean field
• Effectively open real functions
• Real recursive functions and their hierarchy
• A topological view on algebraic computation models

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)