A domain-theoretic approach to computability on the real line
- 23 December 1998
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 210 (1) , 73-98
- https://doi.org/10.1016/s0304-3975(98)00097-8
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Recursion and complexity theory on CPO-SPublished by Springer Nature ,2005
- A New Representation for Exact Real NumbersElectronic Notes in Theoretical Computer Science, 1997
- When Scott is weak on the topMathematical Structures in Computer Science, 1997
- PCF extended with real numbersTheoretical Computer Science, 1996
- Exact real computer arithmetic with continued fractionsIEEE Transactions on Computers, 1990
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- Complete local rings as domainsThe Journal of Symbolic Logic, 1988
- Theory of representationsTheoretical Computer Science, 1985
- Effectively given domainsTheoretical Computer Science, 1977
- Recursive Real NumbersProceedings of the American Mathematical Society, 1954