ZUSE Automat Agent: Empirical Law Discovery in Elementary Cellular Automata

Version v1.7 adds the Fase 29–30 symbolic-boundary analysis of the T=15 oscillator family. Fase 29 tests whether the rule_73/rule_109 T=15 mechanism can be reduced to a pure defect-only dynamic or to a fixed local block signature. It cannot: canonical XOR-defect shapes are background-specific already at W=0, and no nontrivial shared local block signature exists across all backgrounds. This rules out a simple local-window derivation of the five-state cycle. Fase 30 shows that the variation is nevertheless structured rather than arbitrary. The 20 minimal T=15 representatives collapse into 13 phase-rotated defect-cycle shape families: 7 families for rule_73 and 8 for rule_109, with two families shared across the conjugate rules. Simple scalar background descriptors such as active_count and transition_count do not determine the family; the temporal background orbit and IC alignment must be part of any future symbolic derivation. Together with Fase 28, v1.7 completes the current symbolic-delimitation arc: the T=15 locking mechanism is established computationally, exact black/white conjugation is proved analytically, sparse truth-table support is rejected, fixed local block derivation is rejected, and the remaining problem is reduced to mapping background temporal orbit plus IC alignment to one of a finite set of defect-cycle families and phase offsets. ZUSE Automat Agent is a deterministic, policy-driven discovery loop for elementary cellular automata. It builds an empirical atlas of cycle laws, world families, basin fragility, and background-conditioned oscillator dynamics using fixed evaluators and reproducible scripts. The discovery loop itself is deterministic. Language-model assistance was used only after execution for interpretation and documentation, not for world selection, law evaluation, scoring, or acceptance of empirical results. All results are reproducible from deterministic scripts with no stochastic components in the discovery loop. Repository: https://github.com/conchaestradamiguelangel-droid/zuse-automat-agent

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-06-27
DOI
https://doi.org/10.5281/zenodo.20971737
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.7 adds the Fase 29–30 symbolic-boundary analysis of the T=15 oscillator family. Fase 29 tests whether the rule_73/rule_109 T=15 mechanism can be reduced to a pure defect-only dynamic or to a fixed local block signature. It cannot: canonical XOR-defect shapes are background-specific already at W=0, and no nontrivial shared local block signature exists across all backgrounds. This rules out a simple local-window derivation of the five-state cycle. Fase 30 shows that the variation is nevertheless structured rather than arbitrary. The 20 minimal T=15 representatives collapse into 13 phase-rotated defect-cycle shape families: 7 families for rule_73 and 8 for rule_109, with two families shared across the conjugate rules. Simple scalar background descriptors such as active_count and transition_count do not determine the family; the temporal background orbit and IC alignment must be part of any future symbolic derivation. Together with Fase 28, v1.7 completes the current symbolic-delimitation arc: the T=15 locking mechanism is established computationally, exact black/white conjugation is proved analytically, sparse truth-table support is rejected, fixed local block derivation is rejected, and the remaining problem is reduced to mapping background temporal orbit plus IC alignment to one of a finite set of defect-cycle families and phase offsets. ZUSE Automat Agent is a deterministic, policy-driven discovery loop for elementary cellular automata. It builds an empirical atlas of cycle laws, world families, basin fragility, and background-conditioned oscillator dynamics using fixed evaluators and reproducible scripts. The discovery loop itself is deterministic. Language-model assistance was used only after execution for interpretation and documentation, not for world selection, law evaluation, scoring, or acceptance of empirical results. All results are reproducible from deterministic scripts with no stochastic components in the discovery loop. Repository: https://github.com/conchaestradamiguelangel-droid/zuse-automat-agent

Zenodo (CERN European Organization for Nuclear Research)
Peace, Justice and strong institutions
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.