메뉴 건너뛰기




Volumn 398, Issue 1-3, 2008, Pages 170-182

Computability and the morphological complexity of some dynamics on continuous domains

Author keywords

Chaotic dynamics; Computability over continuous domains; Decidability; Shadowing; Singularities; Unpredictability

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; NUMERICAL METHODS;

EID: 42749085555     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.01.048     Document Type: Article
Times cited : (7)

References (42)
  • 2
    • 44849090890 scopus 로고    scopus 로고
    • F. Bailly, G. Longo, Extended critical situations: The physical singularity of life phenomena, Journal of Biological Systems (2008) (in press)
    • F. Bailly, G. Longo, Extended critical situations: The physical singularity of life phenomena, Journal of Biological Systems (2008) (in press)
  • 3
    • 42749096477 scopus 로고    scopus 로고
    • Randomness and determination in the interplay between the continuum and the discrete
    • (special issue). (largely revised version of the appendix to the book: [1])
    • Bailly F., and Longo G. Randomness and determination in the interplay between the continuum and the discrete. Mathematical Structures in Computer Science 17 2 (2007) 289-307 (special issue). (largely revised version of the appendix to the book: [1])
    • (2007) Mathematical Structures in Computer Science , vol.17 , Issue.2 , pp. 289-307
    • Bailly, F.1    Longo, G.2
  • 4
    • 42749095677 scopus 로고    scopus 로고
    • O. Bournez, Modèles continus. Calcul. Habilitation à diriger les recherches, LORIA, Univ. de Nancy, Décembre, 2006
    • O. Bournez, Modèles continus. Calcul. Habilitation à diriger les recherches, LORIA, Univ. de Nancy, Décembre, 2006
  • 6
    • 0001799332 scopus 로고    scopus 로고
    • Computability on subsets of Euclidean space I: Closed and compact subsets
    • Brattka V., and Weihrauch K. Computability on subsets of Euclidean space I: Closed and compact subsets. Theoretical Computer Science 219 (1999) 65-93
    • (1999) Theoretical Computer Science , vol.219 , pp. 65-93
    • Brattka, V.1    Weihrauch, K.2
  • 7
    • 23844462483 scopus 로고    scopus 로고
    • Continuity and computability of reachable sets
    • Collins P. Continuity and computability of reachable sets. Theoretical Computer Science 341 (2005)
    • (2005) Theoretical Computer Science , vol.341
    • Collins, P.1
  • 8
    • 42749097090 scopus 로고    scopus 로고
    • F. De Jaeger, Calculabilité sur les réels. Thèse en Informatique (dir.: M. Escardo, G. Longo), Université de Paris VII, Novembre 2002
    • F. De Jaeger, Calculabilité sur les réels. Thèse en Informatique (dir.: M. Escardo, G. Longo), Université de Paris VII, Novembre 2002
  • 9
    • 42749086841 scopus 로고    scopus 로고
    • Computability of the functionals over the reals with the effective filter spaces
    • De Jaeger F. Computability of the functionals over the reals with the effective filter spaces. Topology Proceedings 26 2 (2001-2002)
    • (2001) Topology Proceedings , vol.26 , Issue.2
    • De Jaeger, F.1
  • 11
    • 0002230432 scopus 로고
    • Dynamical systems, measures and fractals via domain theory
    • Edalat A. Dynamical systems, measures and fractals via domain theory. Information and Computation 120 1 (1995) 32-48
    • (1995) Information and Computation , vol.120 , Issue.1 , pp. 32-48
    • Edalat, A.1
  • 12
    • 0001643398 scopus 로고    scopus 로고
    • Domains for computation in mathematics, physics and exact real arithmetic
    • Edalat A. Domains for computation in mathematics, physics and exact real arithmetic. Bulletin of Symbolic Logic 3 4 (1997) 401-452
    • (1997) Bulletin of Symbolic Logic , vol.3 , Issue.4 , pp. 401-452
    • Edalat, A.1
  • 13
    • 0002864146 scopus 로고
    • Model C of partial continuous functionals
    • Gandy R., and Hyland M. (Eds), North-Holland, Amsterdam
    • Ershov Yu.L. Model C of partial continuous functionals. In: Gandy R., and Hyland M. (Eds). Logic Colloquium vol. 76 (1976), North-Holland, Amsterdam
    • (1976) Logic Colloquium , vol.76
    • Ershov, Yu.L.1
  • 14
    • 42749088080 scopus 로고    scopus 로고
    • G. Frege, The Foundations of Arithmetic, 1884. Engl. transl. Evanston, 1980
    • G. Frege, The Foundations of Arithmetic, 1884. Engl. transl. Evanston, 1980
  • 16
    • 0009077570 scopus 로고
    • Sensitive dependence to initial conditions for one dimensional maps
    • Guckenheimer J. Sensitive dependence to initial conditions for one dimensional maps. Comm. Math. Phys. 70 (1979) 133-160
    • (1979) Comm. Math. Phys. , vol.70 , pp. 133-160
    • Guckenheimer, J.1
  • 17
    • 42749095012 scopus 로고    scopus 로고
    • D. Hilbert, Les fondements de la géométrie, 1899 (trad. fran., Dunod, 1971)
    • D. Hilbert, Les fondements de la géométrie, 1899 (trad. fran., Dunod, 1971)
  • 18
    • 42749085746 scopus 로고    scopus 로고
    • Dynamical systems: Stability and simulability
    • 3-body, classical-quantum, discrete-continuum (special issue)
    • Hoyrup M. Dynamical systems: Stability and simulability. 3-body, classical-quantum, discrete-continuum. Mathematical Structures in Computer Science 17 2 (2007) 247-260 (special issue)
    • (2007) Mathematical Structures in Computer Science , vol.17 , Issue.2 , pp. 247-260
    • Hoyrup, M.1
  • 19
    • 0001556003 scopus 로고
    • Filter spaces and continuous functionals
    • Hyland M. Filter spaces and continuous functionals. Annals of Mathematics and Logic 16 (1979) 101-143
    • (1979) Annals of Mathematics and Logic , vol.16 , pp. 101-143
    • Hyland, M.1
  • 21
    • 42749086290 scopus 로고    scopus 로고
    • A. Kolcak, Physical predictability and the dynamics of intervals, Information and Computation, 2008 (Draft, in preparation)
    • A. Kolcak, Physical predictability and the dynamics of intervals, Information and Computation, 2008 (Draft, in preparation)
  • 22
    • 42749087232 scopus 로고    scopus 로고
    • J. Laskar, La stabilité de système solaire, Chaos et déterminisme, Seuil, 1992
    • J. Laskar, La stabilité de système solaire, Chaos et déterminisme, Seuil, 1992
  • 23
    • 0000370796 scopus 로고
    • The hereditary partial recursive functionals and recursion theory in higher types
    • Longo G., and Moggi E. The hereditary partial recursive functionals and recursion theory in higher types. Journal of Symbolic Logic 49 4 (1984) 1319-1332
    • (1984) Journal of Symbolic Logic , vol.49 , Issue.4 , pp. 1319-1332
    • Longo, G.1    Moggi, E.2
  • 24
    • 42749096012 scopus 로고    scopus 로고
    • G. Longo, Space and time in the foundation of mathematics, or some challenges in the interaction with other sciences, Invited lecture at the First AMS/SMF meeting, Lyon, July 2001 (french version in Intellectica, 2003/1-2, n. 36-37)
    • G. Longo, Space and time in the foundation of mathematics, or some challenges in the interaction with other sciences, Invited lecture at the First AMS/SMF meeting, Lyon, July 2001 (french version in Intellectica, 2003/1-2, n. 36-37)
  • 25
    • 42749087161 scopus 로고    scopus 로고
    • G. Longo, Some topologies for computations, Invited Lecture, in: Proceedings of Géométrie au XX siècle, 1930-2000, Hermann, Paris, 2004
    • G. Longo, Some topologies for computations, Invited Lecture, in: Proceedings of Géométrie au XX siècle, 1930-2000, Hermann, Paris, 2004
  • 26
    • 84967350873 scopus 로고    scopus 로고
    • G. Longo, The reasonable effectiveness of mathematics and its cognitive roots. In: L. Boi (ed.), Geometries of Nature, Living Systems and Human Cognition series in New Interactions of Mathematics with Natural Sciences and Humaties, World Scientific, 2005, pp. 351-382
    • G. Longo, The reasonable effectiveness of mathematics and its cognitive roots. In: L. Boi (ed.), Geometries of Nature, Living Systems and Human Cognition series in New Interactions of Mathematics with Natural Sciences and Humaties, World Scientific, 2005, pp. 351-382
  • 27
    • 42749091460 scopus 로고    scopus 로고
    • Laplace, Turing and the imitation game impossible geometry: Randomness, determinism and programs in Turing's test
    • Epstein R., Roberts G., and Beber G. (Eds), Springer
    • Longo G. Laplace, Turing and the imitation game impossible geometry: Randomness, determinism and programs in Turing's test. In: Epstein R., Roberts G., and Beber G. (Eds). Parsing the Turing Test (2008), Springer
    • (2008) Parsing the Turing Test
    • Longo, G.1
  • 29
    • 42749092574 scopus 로고    scopus 로고
    • Y. Moschovakis, Recursive metric spaces. Fundamenta. Mathematicae, LV, 1964
    • Y. Moschovakis, Recursive metric spaces. Fundamenta. Mathematicae, LV, 1964
  • 32
    • 42749085042 scopus 로고    scopus 로고
    • H. Rogers, Theory of Recursive Functions and Effective Computability, 1967
    • H. Rogers, Theory of Recursive Functions and Effective Computability, 1967
  • 33
    • 33749908081 scopus 로고
    • Classes of recursively enumerable sets and their decision problem
    • Rice H. Classes of recursively enumerable sets and their decision problem. Transactions of the AMS 74 (1953)
    • (1953) Transactions of the AMS , vol.74
    • Rice, H.1
  • 34
    • 42749083175 scopus 로고    scopus 로고
    • T. Sauer, Shadowing breakdown and large errors in dynamical simulations of physical systems, George Mason Univ., 2003, preprint
    • T. Sauer, Shadowing breakdown and large errors in dynamical simulations of physical systems, George Mason Univ., 2003, preprint
  • 35
    • 42749094928 scopus 로고    scopus 로고
    • D.S. Scott, Outline of a mathematical theory of computation, in: 4th Ann. Princeton Conf. on Info. Sci. and Syst., 1970
    • D.S. Scott, Outline of a mathematical theory of computation, in: 4th Ann. Princeton Conf. on Info. Sci. and Syst., 1970
  • 36
    • 0001995203 scopus 로고
    • Continuous lattices
    • Toposes, Algebraic Geometry and Logic, Springer-Verlag, Berlin
    • Scott D.S. Continuous lattices. Toposes, Algebraic Geometry and Logic. LNM vol. 274 (1972), Springer-Verlag, Berlin
    • (1972) LNM , vol.274
    • Scott, D.S.1
  • 38
    • 33244458925 scopus 로고
    • Geometry and generality in Frege's philosophy of Arithmetic
    • Tappenden J. Geometry and generality in Frege's philosophy of Arithmetic. Synthese 102 3 (1995)
    • (1995) Synthese , vol.102 , Issue.3
    • Tappenden, J.1
  • 39
    • 0001602510 scopus 로고
    • On computable numbers with an application to the entscheidungsproblem
    • Turing A. On computable numbers with an application to the entscheidungsproblem. Proceedings of the London Mathematical Society 42 (1936)
    • (1936) Proceedings of the London Mathematical Society , vol.42
    • Turing, A.1
  • 40
    • 0002988210 scopus 로고
    • Computing machines and intelligence
    • Turing A. Computing machines and intelligence. Mind LIX 236 (1950) 433-460
    • (1950) Mind , vol.LIX , Issue.236 , pp. 433-460
    • Turing, A.1


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