scientific article; zbMATH DE number 5582843
From MaRDI portal
Publication:5321501
zbMath1167.68387MaRDI QIDQ5321501
Publication date: 22 July 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)
Related Items (only showing first 100 items - show all)
A cellular automaton for blocking queen games ⋮ Waiting for the rapture: what can we do with computers to (hopefully) witness the emergence of life? ⋮ Freezing 1-Tag Systems with States ⋮ SPF-CA: A new cellular automata based block cipher using key-dependent S-boxes ⋮ The Complexity of Small Universal Turing Machines: A Survey ⋮ Logical gates on gliders in restricted space domain cellular automata ⋮ Unraveling simplicity in elementary cellular automata ⋮ Playing with complexity: from cellular evolutionary algorithms with coalitions to self-organizing maps ⋮ Universal Sleptsov net ⋮ Semi-Galois categories. II: An arithmetic analogue of Christol's theorem ⋮ Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automata ⋮ Non-maximal sensitivity to synchronism in elementary cellular automata: exact asymptotic measures ⋮ More really is different ⋮ CELLULAR AUTOMATA OVER ALGEBRAIC STRUCTURES ⋮ Overview: PCA Models and Issues ⋮ Symbolic dynamics of glider guns for some one-dimensional cellular automata ⋮ Stability of cellular automata trajectories revisited: branching walks and Lyapunov profiles ⋮ Phenomenology of coupled nonlinear oscillators ⋮ Unpredictability and Computational Irreducibility ⋮ Abstract geometrical computation. VIII: Small machines, accumulations \& rationality ⋮ New approach to evaluate the asymptotic distribution of particle systems expressed by probabilistic cellular automata ⋮ An information-based classification of elementary cellular automata ⋮ Exploring nominal cellular automata ⋮ Random expansion method for the generation of complex cellular automata ⋮ Impartial games emulating one-dimensional cellular automata and undecidability ⋮ Rule Primality, Minimal Generating Sets, Turing-Universality and Causal Decomposition in Elementary Cellular Automata ⋮ An RNA-based theory of natural universal computation ⋮ Progress, gaps and obstacles in the classification of cellular automata ⋮ Defect particle kinematics in one-dimensional cellular automata ⋮ Universality in Infinite Petri Nets ⋮ Computational modelling of the kinetic tile assembly model using a rule-based approach ⋮ Four states are enough! ⋮ A universal cellular automaton on the heptagrid of the hyperbolic plane with four states ⋮ Abstract geometrical computation. IV: Small Turing universal signal machines ⋮ A simple P-complete problem and its language-theoretic representations ⋮ On the complex behavior of simple tag systems -- an experimental approach ⋮ Simplicity via provability for universal prefix-free Turing machines ⋮ Computational processes, observers and Turing incompleteness ⋮ Modified von Neumann neighborhood and taxicab geometry-based edge detection technique for infrared images ⋮ Robust periodic solutions and evolution from seeds in one-dimensional edge cellular automata ⋮ Communication complexity meets cellular automata: necessary conditions for intrinsic universality ⋮ An automaton group with undecidable order and Engel problems ⋮ Glider Collisions in Hybrid Cellular Automaton with Memory Rule (43,74) ⋮ Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Noise-robust realization of Turing-complete cellular automata by using neural networks with pattern representation ⋮ Inferring the Limit Behavior of Some Elementary Cellular Automata ⋮ Logical Gates via Gliders Collisions ⋮ Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami ⋮ Semipredictable dynamical systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ BLOCK TRANSFORMATION OF HYBRID CELLULAR AUTOMATA ⋮ Shift-equivalence of \(k\)-ary, one-dimensional cellular automata rules ⋮ Unnamed Item ⋮ Computational capabilities at the edge of chaos for one dimensional systems undergoing continuous transitions ⋮ Symbolic Computation Using Cellular Automata-Based Hyperdimensional Computing ⋮ Reversible computing and cellular automata -- a survey ⋮ Around probabilistic cellular automata ⋮ Reservoir Computing with Computational Matter ⋮ Distributed Multi-authority Attribute-Based Encryption Using Cellular Automata ⋮ Three small universal spiking neural P systems ⋮ Making sense of sensory input ⋮ New aspects of symmetry of elementary cellular automata ⋮ Computational complexity of dynamical systems: the case of cellular automata ⋮ Nondeterministic cellular automata ⋮ On Boolean Automata Networks (de)Composition1 ⋮ Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates ⋮ Tag systems and Collatz-like functions ⋮ Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates ⋮ Topological chaos of universal elementary cellular automata rule ⋮ Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata ⋮ A one-dimensional physically universal cellular automaton ⋮ Invertible behavior in elementary cellular automata with memory ⋮ Elementary cellular automaton Rule 110 explained as a block substitution system. Rule 110 as a block substitution system ⋮ Directed Percolation Arising in Stochastic Cellular Automata Analysis ⋮ How Redundant Is Your Universal Computation Device? ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Automated pattern detection -- an algorithm for constructing optimally synchronizing multi-regular language filters ⋮ Turing-completeness of asynchronous non-camouflage cellular automata ⋮ Small fast universal Turing machines ⋮ Dynamics of universal computation and \(1/f\) noise in elementary cellular automata ⋮ Dynamical criticality: overview and open questions ⋮ A Symbolic Dynamics Perspective of Conway’s Game of Life ⋮ The complexity of small universal Turing machines: A survey ⋮ Threshold-based network structural dynamics ⋮ Threshold-based network structural dynamics ⋮ LUNAR: cellular automata for drifting data streams ⋮ Discrete DNA Reaction-Diffusion Model for Implementing Simple Cellular Automaton ⋮ Average-Case Completeness in Tag Systems ⋮ Emulating cellular automata in chemical reaction-diffusion networks ⋮ Surprising Areas in the Quest for Small Universal Devices ⋮ Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines ⋮ The mirage of universality in cellular automata ⋮ On Boolean automata isolated cycles and tangential double-cycles dynamics ⋮ On fungal automata ⋮ Cellular Automata, Learning Automata, and Cellular Learning Automata for Optimization ⋮ A novel construction of chaotic dynamics base gliders in diffusion rule B2/S7 ⋮ Phenomenology of glider collisions in cellular automaton Rule 54 and associated logical gates
This page was built for publication:
