ZUSE Automat Agent: Empirical Law Discovery in Elementary Cellular Automata

Version v1.10 integrates Fases 35–39 of the T=15 oscillator mechanism. Fases 35–38 replace visual shape families with explicit macro-transition tables and effective orbit embeddings. The induced F^3 transition table is a sufficient discriminator and refines the 13 visual families. Family F00 is explained by convergence to a shared effective period-3 background orbit, while canonical orbit identity alone is too coarse globally. The first sufficient post-burn-in descriptor is: (rule, sample_orbit_step, sample_rotation_offset, defect_state0) Fase 39 tests whether defect_state0 can be predicted compactly before burn-in. The result is negative under the tested descriptors: all 20 representatives enter the stable five-cycle by t=12, and 15/20 enter at t=3, but exact pre-burn-in predictors mostly collapse to singleton case identifiers or post-hoc measurements. This closes the post-burn-in descriptive mechanism and sharply delimits the remaining symbolic problem: predicting defect_state0 from the raw background/IC pair without effectively replaying the early transient. 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-28
DOI
https://doi.org/10.5281/zenodo.21009302
Primary Topic
Cellular Automata and Applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

ZUSE Automat Agent: Empirical Law Discovery in Elementary Cellular Automata

Zenodo (CERN European Organization for Nuclear Research)
Cellular Automata and Applications
preprint

ZUSE Automat Agent: Empirical Law Discovery in Elementary Cellular Automata

preprint en

Abstract

Version v1.10 integrates Fases 35–39 of the T=15 oscillator mechanism. Fases 35–38 replace visual shape families with explicit macro-transition tables and effective orbit embeddings. The induced F^3 transition table is a sufficient discriminator and refines the 13 visual families. Family F00 is explained by convergence to a shared effective period-3 background orbit, while canonical orbit identity alone is too coarse globally. The first sufficient post-burn-in descriptor is: (rule, sample_orbit_step, sample_rotation_offset, defect_state0) Fase 39 tests whether defect_state0 can be predicted compactly before burn-in. The result is negative under the tested descriptors: all 20 representatives enter the stable five-cycle by t=12, and 15/20 enter at t=3, but exact pre-burn-in predictors mostly collapse to singleton case identifiers or post-hoc measurements. This closes the post-burn-in descriptive mechanism and sharply delimits the remaining symbolic problem: predicting defect_state0 from the raw background/IC pair without effectively replaying the early transient. All results are reproducible from deterministic scripts. Repository:https://github.com/conchaestradamiguelangel-droid/zuse-automat-agent

Zenodo (CERN European Organization for Nuclear Research)
Reduced inequalities
Cellular Automata and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.