Orbit complexity by computable structures

被引：14
|
作者：
Galatolo, S
机构：
[1] Univ Pisa, Dipartimento Matemat, I-56100 Pisa, Italy
[2] Univ Pisa, Ctr Interdisciplinare Studio Sistemi Complessi, I-56100 Pisa, Italy
来源：
NONLINEARITY | 2000年 / 13卷 / 05期
关键词：
D O I：
10.1088/0951-7715/13/5/307
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We give a definition of orbit complexity for points in topological dynamical systems over separable metric spaces. Our definition extends Brudno's definition meaningfully to the non-compact case. Interacting with constructive mathematics we investigate questions about orbit complexity from a new point of view. In particular, we show a relation between constructivity, entropy and orbit complexity. AMS classification scheme numbers: 28D20, 58F13.
引用
收藏
页码：1531 / 1546
页数：16
相关论文
共 50 条
  • [1] On the complexity of categoricity in computable structures
    White, WM
    MATHEMATICAL LOGIC QUARTERLY, 2003, 49 (06) : 603 - 614
  • [2] The complexity of computable categoricity
    Downey, Rodney G.
    Kach, Asher M.
    Lempp, Steffen
    Lewis-Pye, Andrew E. M.
    Montalban, Antonio
    Turetsky, Daniel D.
    ADVANCES IN MATHEMATICS, 2015, 268 : 423 - 466
  • [3] ON THE COMPLEXITY OF COMPUTABLE REAL SEQUENCES
    TORAN, J
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1987, 21 (02): : 175 - 180
  • [4] The Complexity of Decomposability of Computable Rings
    Wu, Huishan
    NOTRE DAME JOURNAL OF FORMAL LOGIC, 2023, 64 (01) : 1 - 14
  • [5] THE COMPLEXITY TYPES OF COMPUTABLE SETS
    MAASS, W
    SLAMAN, TA
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1992, 44 (02) : 168 - 192
  • [6] Complexity for partial computable functions over computable Polish spaces
    Korovina, Margarita
    Kudinov, Oleg
    MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2018, 28 (03) : 429 - 447
  • [7] Descriptive complexity of computable sequences
    Durand, B
    Shen, A
    Vereshchagin, N
    THEORETICAL COMPUTER SCIENCE, 2002, 271 (1-2) : 47 - 58
  • [8] Descriptive complexity of computable sequences
    Durand, B
    Shen, A
    Vereshagin, N
    STACS'99 - 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1999, 1563 : 153 - 162
  • [9] Classifications of Computable Structures
    Lange, Karen
    Miller, Russell
    Steiner, Rebecca M.
    NOTRE DAME JOURNAL OF FORMAL LOGIC, 2018, 59 (01) : 35 - 59
  • [10] Locally computable structures
    Miller, Russell G.
    COMPUTATION AND LOGIC IN THE REAL WORLD, PROCEEDINGS, 2007, 4497 : 575 - 584
12345