Ordered Subrings of the Reals in which Output Sets are Recursively Enumerable

DOI10.2307/2160343MaRDI QIDQ5288071zbMATH OpenOpenAlexFDO

Authors Robert Byerly

Publication date 23 August 1993

Full work available at URL https://doi.org/10.2307/2160343

zbMATH Keywords

ordered ringscomputability over the realsfinite transcendence degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• Ordered Rings Over Which Output Sets are Recursively Enumerable Sets
• scientific article; zbMATH DE number 627413
• Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine
• Publication:3033315

Cites work

• A note on computable real fields
• Alfred Tarski's elimination theory for real closed fields
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Ordered Rings Over Which Output Sets are Recursively Enumerable Sets
• The Irrationals are not Recursively Enumerable

Cited in

(4)

• scientific article; zbMATH DE number 4016884 (Why is no real title available?)
• scientific article; zbMATH DE number 627413 (Why is no real title available?)
• scientific article; zbMATH DE number 446847 (Why is no real title available?)
• Ordered Rings Over Which Output Sets are Recursively Enumerable Sets

This page was built for publication: Ordered Subrings of the Reals in which Output Sets are Recursively Enumerable

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