No six-cell neighborhood cellular automaton solves the parity problem
From MaRDI portal
Publication:6639741
Cites work
- scientific article; zbMATH DE number 711298 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 1886322 (Why is no real title available?)
- A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update
- A portfolio of classification problems by one-dimensional cellular automata, over cyclic binary configurations and parallel update
- Conservation laws in cellular automata
- Improvement of a result on sequencing elementary cellular automata rules for solving the parity problem
- Number conserving cellular automata. II: Dynamics.
- Number-conserving cellular automata I: Decidability.
- Solving the parity problem in one-dimensional cellular automata
- Solving the parity problem with rule 60 in array size of the power of two
- Statistical mechanics of cellular automata
- Synchronous solution of the parity problem on cyclic configurations, with elementary cellular automaton rule 150, over a family of directed, non-circulant, regular graphs
- Universality and decidability of number-conserving cellular automata
- Very effective evolutionary techniques for searching cellular automata rule spaces
This page was built for publication: No six-cell neighborhood cellular automaton solves the parity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6639741)
