Cellular automata and discrete complex systems : 22nd IFIP WG 1.5 International Workshop, AUTOMATA 2016, Zurich, Switzerland, June 15-17, 2016, Proceedings /: 22nd IFIP WG 1.5 International Workshop, AUTOMATA 2016, Zurich, Switzerland, June 15-17, 2016, Proceedings. (2016)

• Record Type: Book
• Other Titles: AUTOMATA 2016
• Further Information: Note: Matthew Cook, Turlough Neary (eds.).
• Editors: Cook, Matthew, 1970-; Neary, Turlough
• Other Names: AUTOMATA (Workshop), 22nd
• 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
• Publisher Details: Cham : Springer
• Publication Date: 2016
• Extent: 1 online resource (xvi, 199 pages), illustrations
• Subjects: 004.0151; Computer science; Cellular automata -- Congresses; Computer science -- Mathematics -- Congresses; Cellular automata; Computer science -- Mathematics; Computer Science; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Simulation and Modeling; Computer Communication Networks; Discrete Mathematics in Computer Science; Mathematical Logic and Formal Languages; Computers -- Programming -- Algorithms; Computers -- Computer Simulation; Computers -- Hardware -- Network Hardware; Computers -- Data Processing; Mathematics -- Logic; Algorithms & data structures; Computer modelling & simulation; Network hardware; Discrete mathematics; Mathematical theory of computation; Computer software; Computer simulation; Computer Communication Networks; Computational complexity; Computers -- Machine Theory; User interface design & usability; Electronic books; Conference papers and proceedings
• Languages: English
• ISBNs: 9783319393001; 3319393006; 3319392999; 9783319392998
• Related ISBNs: 9783319392998
• Notes: Note: Online resource; title from PDF title page (SpringerLink, viewed June 13, 2016).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.