Computational classification of cellular automata

DOI10.1080/03081079.2012.695899MaRDI QIDQ2869784zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

automaticitycellular automataclassificationdecidabilitywolfram classes

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4074492
• scientific article; zbMATH DE number 17562
• On the undecidability of attractor properties for cellular automata
• Cellular automata, decidability and phasespace
• scientific article; zbMATH DE number 3896307

Cites work

• Abstract Geometrical Computation and Computable Analysis
• Cellular automata and intermediate degrees.
• Computation theory of cellular automata
• Endomorphisms and automorphisms of the shift dynamical system
• Handbook of computability theory
• scientific article; zbMATH DE number 1818513 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 778215 (Why is no real title available?)
• scientific article; zbMATH DE number 873158 (Why is no real title available?)
• scientific article; zbMATH DE number 2206109 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Languages, equicontinuity and attractors in cellular automata
• On the classifiability of cellular automata
• On the computational complexity of finite cellular automata
• Small fast universal Turing machines
• The complexity of reversible cellular automata
• The Friedberg-Muchnik Theorem Re-Examined
• Transition phenomena in cellular automata rule space
• Twenty Problems in the Theory of Cellular Automata
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)

Cited in

(21)

• Computation theory of cellular automata
• An information-based classification of elementary cellular automata
• On the classifiability of cellular automata
• Inferring local transition functions of discrete dynamical systems from observations of system behavior
• Progress, gaps and obstacles in the classification of cellular automata
• On the undecidability of attractor properties for cellular automata
• Complexity of inferring local transition functions of discrete dynamical systems
• Complexity classes on spatially periodic cellular automata
• Target-oriented self-structuring in classifying cellular automata
• Exemples de classes d'automates cellulaires
• scientific article; zbMATH DE number 4074492 (Why is no real title available?)
• Overview: PCA models and issues
• Characterization of nonlinear dynamic systems for engineering purposes – a partial review
• Mining a class of decision problems for one-dimensional cellular automata
• Iteration of invertible transductions
• Cellular automata, tilings and (un)computability
• Bulking II: Classifications of cellular automata
• Machines, Computations, and Universality
• A comprehensive taxonomy of cellular automata
• A hierarchical classification of cellular automata
• Classifying circular cellular automata

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)