Description |
1 online resource (xvi, 199 pages) : illustrations |
Series |
Lecture notes in computer science, 0302-9743 ; 9664 |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 9664. 0302-9743
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
Contents |
Intro; Preface; Organization; Invited Talk Abstracts; Automata, Semigroups and Dynamical Systems; Propagation, Diffusion and Randomization in Cellular Automata; What Automata Can Provide a Medium for Life?; A Brief Tour of Theoretical Tile Self-Assembly; Contents; Invited Papers; Propagation, Diffusion and Randomization in Cellular Automata; 1 Introduction; 2 Formal Definitions; 2.1 Diamonds and Their Dynamics; 2.2 Ergodic Dynamics; 3 The Ideal World of 1D Abelian Linear Cellular Automata; 3.1 A Characterization of Randomizing CA; 3.2 Interesting Reversible Examples; References |
|
What Automata Can Provide a Medium for Life?1 Introduction; 2 Some Historical Notes; 3 Methodological Problems; 3.1 von Neumann's Fixed-Point Trick; 3.2 Computation Universality Is Not Enough; 3.3 The Fragility of ̀̀All Mine!''; 4 Specific Ergodicity; 5 Emergence; 6 Life and Evolution; 7 Conclusions; References; A Brief Tour of Theoretical Tile Self-Assembly; References; Regular Papers; The Corona Limit of Penrose Tilings Is a Regular Decagon; 1 Introduction; 2 Corona Limit; 3 Penrose Tilings; 4 Growth Cellular Automaton on Penrose Tilings; 5 Rhombus von Neumann Neighborhood Case |
|
6 The Difference of Growth Speeds7 Conclusion; References; The Group of Reversible Turing Machines; 1 Introduction; 1.1 Turing Machines and Their Generalization; 1.2 Our Results and Comparisons with Other Groups; 1.3 Preliminaries; 2 Two Models for Turing Machine Groups; 2.1 The Moving Head Model; 2.2 The Moving Tape Model; 2.3 The Uniform Measure and Reversibility; 2.4 Classical Turing Machines; 3 Properties of RTM and Interesting Subgroups; 3.1 Local Permutations and Oblivious Turing Machines; 3.2 Finite-State Automata; 3.3 Elementary Turing Machines and the LEF Property of RTM |
|
4 Computability Aspects4.1 Basic Decidability Results; 4.2 The Torsion Problem; References; Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automata; 1 Introduction; 2 Definitions and Properties; 3 Dynamics, Simulation and Normalization; 4 Formal Discretization; 5 Correctness; 6 Conclusion; References; An ̀̀almost dual'' to Gottschalk's Conjecture; 1 Introduction; 2 Background; 3 Post-surjectivity; 4 Post-surjectivity on Sofic Groups; 5 Conclusions; References; On Finite Monoids of Cellular Automata; 1 Introduction; 2 Basic Results; 3 The Structure of ICA(G; A) |
|
4 Generating Sets of of CA(GA); References; Sum of Exit Times in Series of Metastable States in Probabilistic Cellular Automata; 1 Introduction; 2 The Model; 3 Metastable States and Main Results; 3.1 Potential Theoretic Approach and Capacities; 3.2 Series of Metastable States for PCA Without Self-interaction; 4 Sketch of proof of Theorem3.1; 4.1 Proof of Lemma3.5; References; Partial Reversibility of One-Dimensional Cellular Automata; 1 Introduction; 2 Background; 2.1 Basics; 2.2 Partial Reversibility Classes; 3 Reversibility Degree; 3.1 Reappraisal of Relative Partial Reversibility in |
Summary |
This volume constitutes the thoroughly refereed proceedings of the 22nd IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2016, held in Zurich, Switzerland, in June 2016. This volume contains 3 invited talks in full-paper length and 12 regular papers, which were carefully reviewed and selected from a total of 23 submissions. The papers feature research on all fundamental aspects of cellular automata and related discrete complex systems and deal with the following topics: dynamical, topological, ergodic and algebraic aspects; algorithmic and complexity issues; emergent properties; formal language processing; symbolic dynamics; models of parallelism and distributed systems; timing schemes; phenomenological descriptions; scientific modeling; and practical applications |
Notes |
International conference proceedings |
|
Includes author index |
|
Online resource; title from PDF title page (SpringerLink, viewed June 13, 2016) |
Subject |
Cellular automata -- Congresses
|
|
Computer science -- Mathematics -- Congresses
|
|
Algorithms & data structures.
|
|
Computer modelling & simulation.
|
|
Network hardware.
|
|
Discrete mathematics.
|
|
Mathematical theory of computation.
|
|
User interface design & usability.
|
|
Computers -- Programming -- Algorithms.
|
|
Computers -- Computer Simulation.
|
|
Computers -- Hardware -- Network Hardware.
|
|
Computers -- Data Processing.
|
|
Mathematics -- Logic.
|
|
Computers -- Machine Theory.
|
|
Cellular automata
|
|
Computer science -- Mathematics
|
Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
Form |
Electronic book
|
Author |
Cook, Matthew, 1970- editor.
|
|
Neary, Turlough, editor
|
ISBN |
9783319393001 |
|
3319393006 |
|
3319392999 |
|
9783319392998 |