ZUSE Automat Agent: Empirical Law Discovery in Elementary Cellular Automata
Version v1.14 integrates Fase 43: ROBDD order-sensitivity and targeted SIFT audit of the dense T=15 causal cone. Fase 42 showed that all 25 causal-cone inputs remain semantically necessary under ROBDD reduction. Fase 43 tests the next direct escape route: whether variable ordering makes the dense Boolean representation compact. Fase 43A compares the ROBDD orders already materialized in Fase 42: natural, reverse, and center_out. The best global order is reverse, but it improves total active-output nodes by only 0.5% relative to natural. The center_out order is worst in 20/20 representatives, with maximum order-sensitivity ratio 3.119x. Fase 43B runs a checkpointed one-pass SIFT search on the most favorable representative: rule_73, background 00111011, family F01. Across 580 evaluated orders, active-output ROBDD size improves only from 16,061 to 16,056 nodes, a 5-node reduction (0.031%), far above the explicit 10,000-node compression gate. Support remains 25/25. The result does not prove global BDD-size optimality over all possible variable orders. It does rule out simple variable reordering, including targeted SIFT on the best known candidate, as the missing symbolic shortcut for the dense cone. All results are reproducible from deterministic scripts. Repository:https://github.com/conchaestradamiguelangel-droid/zuse-automat-agent
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-06-30
- DOI
- https://doi.org/10.5281/zenodo.21084311
- Primary Topic
- Cellular Automata and Applications
- Type
- preprint