Computability over arbitrary fields

DOI10.1145/800169.805429MaRDI QIDQ5402513zbMATH OpenOpenAlexFDO

Authors Gabor T. Herman, Stephen Isard

Publication date 14 March 2014

Published in Proceedings of the first annual ACM symposium on Theory of computing - STOC '69 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/800169.805429

Mathematics Subject Classification ID

Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• scientific article; zbMATH DE number 1285742
• A new approach to computability over the reals
• Publication:4934287
• Algorithmic Procedures
• Computable model theory over the reals

Cited in

(7)

• scientific article; zbMATH DE number 1285742 (Why is no real title available?)
• Computable fields and the bounded Turing reduction
• scientific article; zbMATH DE number 1390022 (Why is no real title available?)
• scientific article; zbMATH DE number 627413 (Why is no real title available?)
• Algorithmic Procedures
• Spectrum of the field of computable real numbers
• NOTES ON THE DPRM PROPERTY FOR LISTABLE STRUCTURES

This page was built for publication: Computability over arbitrary fields

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