Three concepts of decidability for general subsets of uncountable spaces

Theoretical Computer Science

Volumn 351, Issue 1, 2006, Pages 2-13

  Parker, Matthew W ^a  

^a LONDON SCHOOL OF ECONOMICS   (United Kingdom)

Author keywords

Computable analysis; Recursive sets; Recursively approximable sets; Undecidability

Indexed keywords

APPROXIMATION THEORY; COMPUTABILITY AND DECIDABILITY; CONVERGENCE OF NUMERICAL METHODS; QUANTUM THEORY; SOLAR SYSTEM;

COMPUTABLE ANALYSIS; RECURSIVE SETS; RECURSIVELY APPROXIMABLE SETS; UNDECIDABILITY;

SET THEORY;

EID: 31144470093     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.09.052     Document Type: Conference Paper

References (24)

1. J.C. Alexander, J.A. Yorke, Z. You, and I. Kan Riddled basins International J. Bifurcation Chaos Appl. Sci. Eng. 2 1992 795 813
2. L. Blum, F. Cucker, M. Shub, and S. Smale Complexity and Real Computation 1998 Springer New York
3. L. Blum, M. Shub, and S. Smale On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions, and universal machines Bull. Amer. Math. Soc. 21 1989 1 46
4. V. Brattka, and K. Weihrauch Computability on subsets of Euclidean space I: closed and compact subsets Theoret. Comput. Sci. 219 1999 65 93
5. K. Gödel On undecidable propositions of formal mathematical systems Collected Works Vol. I 1986 Oxford University Press Oxford 346 371
6. A. Grzegorczyk Computable functionals Fund. Math. 42 1955 168 202
7. A. Grzegoczyck On the definition of computable functionals Fund. Math. 42 1955 232 239
8. A. Grzegoczyck On the definitions of computable real continuous functions Fund. Math. 44 1957 61 71
9. A. Hemmerling Approximate decidability in Euclidean spaces Math. Logic Quart. 49 2003 34 56
10. K.-I. Ko Complexity Theory of Real Functions 1991 Birkhäuser Boston
11. C. Kreitz, and K. Weihrauch A unified approach to constructive and recursive analysis M.M. Richter Computation and Proof Theory: Proc. Logic Colloquium held in Aachen, July 18-23, Part II, Lecture Notes in Mathematics Vol. 1104 1984 Springer Berlin 259 278
12. M. Kummer, M. Schäfer, Computability of convex sets, STACS'95, Lecture Notes in Computer Science, Vol. 900, Springer, Berlin, 1995, pp. 550-561.
13. W.C. Myrvold The decision problem for entanglement R.S. Cohen Potentiality, Entanglement, and Passion-at-a-Distance: Quantum Mechanical Studies fo Abner Shimony Vol. 2 1997 Kluwer Academic Publishers Great Britain 177 190
14. n : Riddled basins, the KAM tori, and the stability of the solar system Phil. Sci. 70 2 2003 359 382
15. N.A. Šanin Constructive real numbers and function spaces, Translations of Mathematical Monographs 21 1968 AMS Providence, RI (transl. by E. Mendelson)
16. M. Schröder Spaces allowing type-2 complexity theory revisited CCA 2003: Internat. Conf. on Computability and Complexity in Analysis August 28-30, 2003, Cincinnati, USA, FernUniversität, Hagen 2003 345 361
17. R.I. Soare Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets 1987 Springer New York
18. J.C. Sommerer, and E. Ott Intermingled basins of attraction: uncomputability in a simple physical system Phys. Lett. A 214 1996 243 251
19. A. Turing, On computable numbers, with an application to the Entscheid-ungsproblem, Proc. London Mathematical Society, Vol. 42, Series 2, 1936-1937, pp. 230-265; corrections, Vol. 43, 1937, pp. 544-546.
20. K. Weihrauch Type 2 recursion theory Theoret. Comput. Sci. 38 1985 17 33
21. K. Weihrauch Computable Analysis: An Introduction 2000 Springer Berlin
22. S. Wolfram Undecidability and intractability in theoretical physics Phys. Rev. Lett. 54 1985 735 738
23. Q. Zhou Computable real-valued functions on recursive open and closed subsets of Euclidean space Math. Logic Quart. 42 1996 379 409
24. M. Ziegler Computability on regular subsets of Euclidean space Math. Logic Quart. 48 Suppl. 1 2002 157 181