Survivor Sets Under Iterated Constraint Operators - Reframing Emergence as Constraint Survival
Abstract
This work presents a unifying framework in which structure arises through repeated constraint rather than generative construction. Across several classical systems — including prime numbers, Collatz dynamics, Goldbach pairings, cellular automata, and the N-Queens problem — candidate configurations are iteratively filtered by admissibility conditions until a stable survivor set remains.
Fields of Study & Subjects
Complex Systems and Dynamics
Cellular Automata and Applications
Computability
Logic
AI Algorithms
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 8 February 2026
- Language
- EN