Computational classification of cellular automata

DOI10.1080/03081079.2012.695899zbMath1283.68232OpenAlexW2060380425MaRDI QIDQ2869784

Klaus 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

zbMATH Keywords

classificationcellular automatadecidabilityautomaticitywolfram classes

Mathematics Subject Classification ID

Computational learning theory (68Q32) Cellular automata (computational aspects) (68Q80)

Related Items (6)

Overview: PCA Models and Issues ⋮ Progress, gaps and obstacles in the classification of cellular automata ⋮ Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems ⋮ Characterization of nonlinear dynamic systems for engineering purposes – a partial review ⋮ ITERATION OF INVERTIBLE TRANSDUCTIONS ⋮ Inferring local transition functions of discrete dynamical systems from observations of system behavior

Cites Work

• Transition phenomena in cellular automata rule space
• Computation theory of cellular automata
• Handbook of computability theory
• Cellular automata and intermediate degrees.
• The complexity of reversible cellular automata
• On the computational complexity of finite cellular automata
• On the classifiability of cellular automata
• Small fast universal Turing machines
• Abstract Geometrical Computation and Computable Analysis
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Languages, equicontinuity and attractors in cellular automata
• Twenty Problems in the Theory of Cellular Automata
• Endomorphisms and automorphisms of the shift dynamical system
• The Friedberg-Muchnik Theorem Re-Examined
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computational classification of cellular automata