메뉴 건너뛰기




Volumn 219, Issue 1-2, 1999, Pages 65-93

Computability on subsets of Euclidean space I: Closed and compact subsets

Author keywords

Computable analysis; Recursive sets; Representations of hyperspaces

Indexed keywords


EID: 0001799332     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00284-9     Document Type: Article
Times cited : (112)

References (45)
  • 1
    • 0003214410 scopus 로고
    • Topologies on Closed and Closed Convex Sets
    • Kluwer Academic, Dordrecht
    • G. Beer, Topologies on Closed and Closed Convex Sets, Mathematics and Its Applications, vol. 268, Kluwer Academic, Dordrecht, 1993.
    • (1993) Mathematics and Its Applications , vol.268
    • Beer, G.1
  • 4
    • 84968516134 scopus 로고
    • On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines
    • L. Blum, M. Shub, 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(1) (1989) 1-46.
    • (1989) Bull. Amer. Math. Soc. , vol.21 , Issue.1 , pp. 1-46
    • Blum, L.1    Shub, M.2    Smale, S.3
  • 5
    • 0003389241 scopus 로고
    • The Gödel incompleteness theorem and decidability over a ring
    • M.W. Hirsch, J.E. Marsden, M. Shub (Eds.), Springer, New York
    • L. Blum, S. Smale, The Gödel incompleteness theorem and decidability over a ring, in: M.W. Hirsch, J.E. Marsden, M. Shub (Eds.), From Topology to Computation: Proc. Smalefest, Springer, New York, 1993, pp. 321-339.
    • (1993) From Topology to Computation: Proc. Smalefest , pp. 321-339
    • Blum, L.1    Smale, S.2
  • 6
    • 0040757848 scopus 로고    scopus 로고
    • δ-uniform BSS machines
    • P. Boldi, S. Vigna, δ-uniform BSS machines, Journal of Complexity 14(2) (1998) 234-256.
    • (1998) Journal of Complexity , vol.14 , Issue.2 , pp. 234-256
    • Boldi, P.1    Vigna, S.2
  • 7
    • 0030570670 scopus 로고    scopus 로고
    • Recursive characterization of computable real-valued functions and relations
    • V. Brattka, Recursive characterization of computable real-valued functions and relations, Theoret. Comput. Sci. 162 (1996) 45-77.
    • (1996) Theoret. Comput. Sci. , vol.162 , pp. 45-77
    • Brattka, V.1
  • 8
    • 0010264901 scopus 로고    scopus 로고
    • Computable invariance
    • V. Brattka, Computable invariance, Theoret. Comput. Sci. 210 (1999) 3-20.
    • (1999) Theoret. Comput. Sci. , vol.210 , pp. 3-20
    • Brattka, V.1
  • 9
    • 0030524090 scopus 로고    scopus 로고
    • Sets, complements and boundaries
    • D. Bridges, F. Richman, W. Yuchuan, Sets, complements and boundaries, Indag. Math. 7(4) (1996) 425-445.
    • (1996) Indag. Math. , vol.7 , Issue.4 , pp. 425-445
    • Bridges, D.1    Richman, F.2    Yuchuan, W.3
  • 10
    • 0029525043 scopus 로고
    • Computational complexity of two-dimensional regions
    • A. Chou, K.-I. Ko., Computational complexity of two-dimensional regions, SIAM J. Comput. 24 (1995) 923-947.
    • (1995) SIAM J. Comput. , vol.24 , pp. 923-947
    • Chou, A.1    Ko, K.-I.2
  • 13
    • 5144222557 scopus 로고
    • On extreme points of convex compact Turing located sets
    • A. Nerode, Yu.V. Matiyasevich (Eds.), Logical Foundations of Computer Science, 3rd Internat. Symp., LFCS'94, St. Petersburg, Russia, 11-14 July 1994. Springer, Berlin
    • X. Ge, A. Nerode, On extreme points of convex compact Turing located sets, in: A. Nerode, Yu.V. Matiyasevich (Eds.), Logical Foundations of Computer Science, 3rd Internat. Symp., LFCS'94, St. Petersburg, Russia, 11-14 July 1994. Lecture Notes in Computer Science, vol. 813, Springer, Berlin, 1994, pp. 114-128.
    • (1994) Lecture Notes in Computer Science , vol.813 , pp. 114-128
    • Ge, X.1    Nerode, A.2
  • 15
    • 0001161931 scopus 로고
    • Computable functionals
    • A. Grzegorczyk, Computable functionals, Fund. Math. 42 (1955) 168-202.
    • (1955) Fund. Math. , vol.42 , pp. 168-202
    • Grzegorczyk, A.1
  • 16
    • 84982625537 scopus 로고
    • Berechenbare reelle Funktionen
    • J. Hauck, Berechenbare reelle Funktionen, Z. math. Logik Grundlagen Math. 19 (1973) 121-140.
    • (1973) Z. Math. Logik Grundlagen Math. , vol.19 , pp. 121-140
    • Hauck, J.1
  • 18
    • 85012630262 scopus 로고
    • Computational complexity of real functions
    • K.-I. Ko, H. Friedman, Computational complexity of real functions, Theoret. Comput. Sci. 20 (1982) 323-352.
    • (1982) Theoret. Comput. Sci. , vol.20 , pp. 323-352
    • Ko, K.-I.1    Friedman, H.2
  • 19
    • 0029694620 scopus 로고    scopus 로고
    • On the measure of two-dimensional regions with polynomial-time computable boundaries
    • S. Homer, J.-Y. Cai (Eds.), IEEE Computer Society Press, Los Alamitos
    • K.-I. Ko, K. Weihrauch, On the measure of two-dimensional regions with polynomial-time computable boundaries, in: S. Homer, J.-Y. Cai (Eds.), 11th Annual IEEE Conf. on Computational Complexity, IEEE Computer Society Press, Los Alamitos, 1996, pp. 150-159.
    • (1996) 11th Annual IEEE Conf. on Computational Complexity , pp. 150-159
    • Ko, K.-I.1    Weihrauch, K.2
  • 20
    • 0011282577 scopus 로고
    • Ensembles récursivement mesurables et ensembles récursivement ouverts et fermés
    • G. Kreisel, D. Lacombe, Ensembles récursivement mesurables et ensembles récursivement ouverts et fermés, C. R. Acad. Sci. Paris 245 (1957) 1106-1109.
    • (1957) C. R. Acad. Sci. Paris , vol.245 , pp. 1106-1109
    • Kreisel, G.1    Lacombe, D.2
  • 21
    • 0010122757 scopus 로고
    • A unified approach to constructive and recursive analysis
    • M.M. Richter, E. Börger, W. Oberschelp, B. Schinzel, W. Thomas (Eds.), Computation and Proof Theory, Proc. Logic Colloquium, Aachen, 18-23 July 1983, Part II. Springer, Berlin
    • C. Kreitz, K. Weihrauch, A unified approach to constructive and recursive analysis, in: M.M. Richter, E. Börger, W. Oberschelp, B. Schinzel, W. Thomas (Eds.), Computation and Proof Theory, Proc. Logic Colloquium, Aachen, 18-23 July 1983, Part II. Lecture Notes in Mathematics, vol. 1104, Springer, Berlin, 1984, pp. 259-278.
    • (1984) Lecture Notes in Mathematics , vol.1104 , pp. 259-278
    • Kreitz, C.1    Weihrauch, K.2
  • 23
    • 38249037252 scopus 로고
    • Compactness in constructive analysis revisited
    • C. Kreitz, K. Weihrauch, Compactness in constructive analysis revisited, Ann. Pure Appl. Logic 36 (1987) 29-38.
    • (1987) Ann. Pure Appl. Logic , vol.36 , pp. 29-38
    • Kreitz, C.1    Weihrauch, K.2
  • 24
    • 0000189389 scopus 로고
    • Classes récursivement fermés et fonctions majorantes
    • Théorie des fonctions
    • D. Lacombe, Classes récursivement fermés et fonctions majorantes, C. R. Acad. Sci. Paris 240 (1955) 716-718. Théorie des fonctions.
    • (1955) C. R. Acad. Sci. Paris , vol.240 , pp. 716-718
    • Lacombe, D.1
  • 25
    • 0009950375 scopus 로고
    • Les ensembles récursivement ouverts ou fermés, et leurs applications àl'Analyse récursive
    • Logique
    • D. Lacombe, Les ensembles récursivement ouverts ou fermés, et leurs applications àl'Analyse récursive, C. R. Acad. Sci. Paris 246 (1958) 28-31. Logique.
    • (1958) C. R. Acad. Sci. Paris , vol.246 , pp. 28-31
    • Lacombe, D.1
  • 26
    • 79959218802 scopus 로고
    • The introduction of non-recursive methods into mathematics
    • A.S. Troelstra, D. van Dalen (Eds.), The L.E.J. Brouwer Centenary Symp., Proc. Conf. Noordwijkerhout, 8-13 June 1981. North-Holland, Amsterdam
    • G. Metakides, A. Nerode, The introduction of non-recursive methods into mathematics, in: A.S. Troelstra, D. van Dalen (Eds.), The L.E.J. Brouwer Centenary Symp., Proc. Conf. Noordwijkerhout, 8-13 June 1981. Studies in Logic and the Foundations of Mathematics, vol. 110, North-Holland, Amsterdam, 1982, pp. 319-335.
    • (1982) Studies in Logic and the Foundations of Mathematics , vol.110 , pp. 319-335
    • Metakides, G.1    Nerode, A.2
  • 27
    • 0000767494 scopus 로고    scopus 로고
    • Computability structures on metric spaces
    • D.S. Bridges, C.S. Calude, J. Gibbons, S. Reeves, I.H. Witten (Eds.), Combinatorics, Complexity, and Logic, Proc. DMTCS'96. Springer, Singapore
    • T. Mori, Y. Tsujii, M. Yasugi, Computability structures on metric spaces, in: D.S. Bridges, C.S. Calude, J. Gibbons, S. Reeves, I.H. Witten (Eds.), Combinatorics, Complexity, and Logic, Proc. DMTCS'96. Discrete Mathematics and Theoretical Computer Science, Springer, Singapore, 1997, pp. 351-362.
    • (1997) Discrete Mathematics and Theoretical Computer Science , pp. 351-362
    • Mori, T.1    Tsujii, Y.2    Yasugi, M.3
  • 28
    • 0001594918 scopus 로고
    • Application of pure recursion theory in recursive analysis
    • in Chinese
    • A. Nerode, W.-Q. Huang, Application of pure recursion theory in recursive analysis, Acta Math. Sin. 28 (1985) 625-636 (in Chinese).
    • (1985) Acta Math. Sin. , vol.28 , pp. 625-636
    • Nerode, A.1    Huang, W.-Q.2
  • 30
    • 0003688270 scopus 로고
    • The Emperor's New Mind, Concerning Computers
    • Oxford University Press, New York
    • R. Penrose, The Emperor's New Mind, Concerning Computers, Minds and The Laws of Physics, Oxford University Press, New York, 1989.
    • (1989) Minds and the Laws of Physics
    • Penrose, R.1
  • 32
    • 0346900603 scopus 로고
    • Natural numberings and generalized computability
    • A. Reiser, K. Weihrauch, Natural numberings and generalized computability, Elektron. Inform. Kybernet. 16 (1980) 11-20.
    • (1980) Elektron. Inform. Kybernet. , vol.16 , pp. 11-20
    • Reiser, A.1    Weihrauch, K.2
  • 34
    • 77956705762 scopus 로고
    • Examples of semicomputable sets of real and complex numbers
    • J.P. Myers, M.J. O'Donnell (Eds.), Springer, Berlin, Summer Symp. San Antonio, TX, 19-22 June 1991
    • J.V. Tucker, J.I. Zucker, Examples of semicomputable sets of real and complex numbers, in: J.P. Myers, M.J. O'Donnell (Eds.), Constructivity in Computer Science, Springer, Berlin, 1992, pp. 179-198. Summer Symp. San Antonio, TX, 19-22 June 1991.
    • (1992) Constructivity in Computer Science , pp. 179-198
    • Tucker, J.V.1    Zucker, J.I.2
  • 35
  • 37
    • 0027911283 scopus 로고
    • Computability on computable metric spaces
    • K. Weihrauch, Computability on computable metric spaces, Theoret. Comput. Sci. 113 (1993) 191-210.
    • (1993) Theoret. Comput. Sci. , vol.113 , pp. 191-210
    • Weihrauch, K.1
  • 40
    • 0002062714 scopus 로고    scopus 로고
    • A foundation for computable analysis
    • D.S. Bridges, C.S. Calude, J. Gibbons, S. Reeves, I.H. Witten (Eds.), Combinatorics, Complexity, and Logic, Proc. DMTCS'96. Springer, Singapore
    • K. Weihrauch, A foundation for computable analysis, in: D.S. Bridges, C.S. Calude, J. Gibbons, S. Reeves, I.H. Witten (Eds.), Combinatorics, Complexity, and Logic, Proc. DMTCS'96. Discrete Mathematics and Theoretical Computer Science, Springer, Singapore, 1997, pp. 66-89.
    • (1997) Discrete Mathematics and Theoretical Computer Science , pp. 66-89
    • Weihrauch, K.1
  • 42
    • 0000793128 scopus 로고
    • Representations of the real numbers and of the open subsets of the set of real numbers
    • K. Weihrauch, C. Kreitz, Representations of the real numbers and of the open subsets of the set of real numbers, Ann. Pure Appl. Logic 35 (1987) 247-260.
    • (1987) Ann. Pure Appl. Logic , vol.35 , pp. 247-260
    • Weihrauch, K.1    Kreitz, C.2
  • 43
    • 0346900601 scopus 로고    scopus 로고
    • Effective separation axioms
    • N. Zhong, Effective separation axioms, Questions Answers Gen. Topology 14(2) (1996) 177-185.
    • (1996) Questions Answers Gen. Topology , vol.14 , Issue.2 , pp. 177-185
    • Zhong, N.1
  • 44
    • 0013381158 scopus 로고    scopus 로고
    • Recursively enumerable subsets of Rq in two computing models: Blum-Shub-Smale machine and Turing machine
    • N. Zhong, Recursively enumerable subsets of Rq in two computing models: Blum-Shub-Smale machine and Turing machine, Theoret. Comput. Sci. 197 (1998) 79-94.
    • (1998) Theoret. Comput. Sci. , vol.197 , pp. 79-94
    • Zhong, N.1
  • 45
    • 0030304759 scopus 로고    scopus 로고
    • Computable real-valued functions on recursive open and closed subsets of Euclidean space
    • Q. Zhou, Computable real-valued functions on recursive open and closed subsets of Euclidean space, Math. Logic Q. 42 (1996) 379-409.
    • (1996) Math. Logic Q. , vol.42 , pp. 379-409
    • Zhou, Q.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.