Computational classification of cellular automata
From MaRDI portal
Publication:2869784
DOI10.1080/03081079.2012.695899zbMATH Open1283.68232OpenAlexW2060380425MaRDI QIDQ2869784FDOQ2869784
Authors: K. Sutner
Publication date: 6 January 2014
Published in: International Journal of General Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081079.2012.695899
Recommendations
Cites Work
- Title not available (Why is that?)
- Abstract Geometrical Computation and Computable Analysis
- Endomorphisms and automorphisms of the shift dynamical system
- Languages, equicontinuity and attractors in cellular automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of reversible cellular automata
- Title not available (Why is that?)
- Computation theory of cellular automata
- Twenty Problems in the Theory of Cellular Automata
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
- On the computational complexity of finite cellular automata
- Small fast universal Turing machines
- Cellular automata and intermediate degrees.
- On the classifiability of cellular automata
- The Friedberg-Muchnik Theorem Re-Examined
- Transition phenomena in cellular automata rule space
- Handbook of computability theory
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (17)
- Title not available (Why is that?)
- ITERATION OF INVERTIBLE TRANSDUCTIONS
- Progress, gaps and obstacles in the classification of cellular automata
- Bulking II: Classifications of cellular automata
- A hierarchical classification of cellular automata
- Inferring local transition functions of discrete dynamical systems from observations of system behavior
- Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems
- Machines, Computations, and Universality
- Exemples de classes d'automates cellulaires
- Target-oriented self-structuring in classifying cellular automata
- On the classifiability of cellular automata
- An information-based classification of elementary cellular automata
- A comprehensive taxonomy of cellular automata
- Overview: PCA Models and Issues
- Computation theory of cellular automata
- Characterization of nonlinear dynamic systems for engineering purposes – a partial review
- Cellular automata, tilings and (un)computability
This page was built for publication: Computational classification of cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2869784)