arXiv (All)
open access
Towards New Parity Rules with Asynchronous Updating Inspired by Fatès's Rule
The parity problem in 1D Cellular Automata is a classifier based on a local rule. If the number of ones in a ring of binary cells is odd then the automaton shall converge to all-one (11...11) else to all-zero (00...00). The objective is to find rules that are related to Fatès's Balanced Rule F but u
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Timed parity games: Complexity and robustness#247088
- NIST SP 800-142: Practical Combinatorial Testing#2896
- Subitizing Butterfly#1042281
- Strategy construction for parity games with imperfect information#247089
- Decision making in the face of parity#91299
Record · ID 1324627
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive