Approximate decidability in euclidean spaces
- 16 January 2003
- journal article
- research article
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 49 (1) , 34-56
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Complexity theory on real numbers and functions2005
- Effective metric spaces and representations of the realsTheoretical Computer Science, 2002
- Computable Banach spaces via domain theoryTheoretical Computer Science, 1999
- On approximate and algebraic computability over the real numbersTheoretical Computer Science, 1999
- Computability on subsets of Euclidean space I: closed and compact subsetsTheoretical Computer Science, 1999
- Recursively enumerable subsets of Rq in two computing models Blum-Shub-Smale machine and Turing machineTheoretical Computer Science, 1998
- Computable Real-Valued Functions on Recursive Open and Closed Subsets of Euclidean SpaceMathematical Logic Quarterly, 1996
- Computability on computable metric spacesTheoretical Computer Science, 1993
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- Theory of representationsTheoretical Computer Science, 1985