Decidability and undecidability in cellular automata

被引：7
|
作者：
Kari, Jarkko [1 ]
机构：
[1] Univ Turku, Dept Math, FI-20014 Turku, Finland
来源：
INTERNATIONAL JOURNAL OF GENERAL SYSTEMS | 2012年 / 41卷 / 06期
基金：
芬兰科学院;
关键词：
cellular automata; undecidability; tiling problem; APERIODIC SET; LIMIT-SETS; ENTROPY; REVERSIBILITY; SENSITIVITY;
D O I：
10.1080/03081079.2012.695895
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We survey results on decidability questions concerning cellular automata. Properties discussed include reversibility and surjectivity and their variants, time-symmetry and conservation laws, nilpotency and other properties of the limit set and the trace, properties chaoticity related such as sensitivity to initial conditions and mixing of the space, and dynamics from finite initial configurations. We also discuss briefly the tiling problem and its variants, and consider the influence of the dimension of the space on the decidability status of the questions.
引用
收藏
页码：539 / 554
页数：16
相关论文
共 50 条
  • [31] Asynchronous spiking neural P systems: Decidability and undecidability
    Cavaliere, Matteo
    Egecioglu, Omer
    Ibarra, Oscar H.
    Ionescu, Mihai
    Paun, Gheorghe
    Woodworth, Sara
    DNA COMPUTING, 2008, 4848 : 246 - +
  • [32] Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
    Bresolin, D.
    Della Monica, D.
    Goranko, V.
    Montanari, A.
    Sciavicco, G.
    ECAI 2010 - 19TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2010, 215 : 695 - 700
  • [33] DECIDABILITY OR UNDECIDABILITY OF SOME THEORIES OF MEASURE-SPACES
    TULIPANI, S
    JOURNAL OF SYMBOLIC LOGIC, 1984, 49 (02) : 707 - 707
  • [34] DECIDABILITY, UNDECIDABILITY, AND GODEL'S INCOMPLETENESS IN RELATIVITY THEORIES
    Andreka, Hajnal
    Madarasz, Judit
    Nemeti, Istvan
    PARALLEL PROCESSING LETTERS, 2012, 22 (03)
  • [35] On the boundary between decidability and undecidability of asynchronous session subtyping
    Bravetti, Mario
    Carbone, Marco
    Zavattaro, Gianluigi
    THEORETICAL COMPUTER SCIENCE, 2018, 722 : 19 - 51
  • [36] Decidability, Introduction Rules and Automata
    Dowek, Gilles
    Jiang, Ying
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, (LPAR-20 2015), 2015, 9450 : 97 - 111
  • [37] Classes of timed automata and the undecidability of universality
    Moura, Arnaldo V.
    Pinto, Guilherme A.
    FUNDAMENTA INFORMATICAE, 2008, 82 (1-2) : 171 - 184
  • [38] Refining the undecidability frontier of hybrid automata
    Mysore, V
    Pnueli, A
    FSTTCS 2005: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2005, 3821 : 261 - 272
  • [39] DECIDABILITY FOR SOME PROBLEMS OF LINEAR CELLULAR-AUTOMATA OVER FINITE COMMUTATIVE RINGS
    SATO, T
    INFORMATION PROCESSING LETTERS, 1993, 46 (03) : 151 - 155
  • [40] Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
    Dennunzio, Alberto
    Formenti, Enrico
    Weiss, Michael
    THEORETICAL COMPUTER SCIENCE, 2014, 516 : 40 - 59
12345