Semantic characterisations of second-order computability over the real numbers

DOI10.1007/3-540-44802-0_12MaRDI QIDQ4783306zbMATH OpenFDO

Authors Oleg Kudinov, M. V. Korovina

Publication date 4 December 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2142/21420160

Mathematics Subject Classification ID

Abstract and axiomatic computability and recursion theory (03D75) Constructive and recursive analysis (03F60)

Recommendations

• Real number computability and domain theory
• Formalisation of computability of operators and real-valued functionals via domain theory
• Characteristic properties of majorant-computability over the reals
• scientific article; zbMATH DE number 1531376
• New Computational Paradigms

Cited in

(6)

• On Σ‐definability without equality over the real numbers
• scientific article; zbMATH DE number 5360217 (Why is no real title available?)
• Formalisation of computability of operators and real-valued functionals via domain theory
• Fixed points on the real numbers without the equality test
• Sequential real number computation and recursive relations
• Remarks on \(\Sigma\)-definability without the equality test over the reals

This page was built for publication: Semantic characterisations of second-order computability over the real numbers

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