No six-cell neighborhood cellular automaton solves the parity problem
From MaRDI portal
Publication:6639741
DOI10.1016/J.TCS.2024.114923MaRDI QIDQ6639741FDOQ6639741
Authors: Anna Nenca, Barbara Wolnik, B. De Baets 
Publication date: 18 November 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update
- Solving the parity problem in one-dimensional cellular automata
- Improvement of a result on sequencing elementary cellular automata rules for solving the parity problem
- Very effective evolutionary techniques for searching cellular automata rule spaces
- Statistical mechanics of cellular automata
- Title not available (Why is that?)
- Number-conserving cellular automata I: Decidability.
- Universality and decidability of number-conserving cellular automata
- Conservation laws in cellular automata
- Title not available (Why is that?)
- Number conserving cellular automata. II: Dynamics.
- A portfolio of classification problems by one-dimensional cellular automata, over cyclic binary configurations and parallel update
- Solving the parity problem with rule 60 in array size of the power of two
- Synchronous solution of the parity problem on cyclic configurations, with elementary cellular automaton rule 150, over a family of directed, non-circulant, regular graphs
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)
