1. Classical background: what “Turing completeness” really asserts
A system is Turing-complete if it can: store and modify symbols (arbitrary memory), and
apply conditional rules repeatedly (control flow). That is: any computable function can be implemented by some combination of data representation,
conditional branching (IF), and
iteration (FOR). This was Alan Turing’s 1936 insight: that a finite set of mechanical rules can simulate any process that can be described algorithmically.
So far, so logical. 2. GENESIS’s challenge: logic is a special case of life
In GENESIS, we no longer begin from logic, but from life-like processes: reproduction,
coupling,
compression (assimilation),
preference...
