Properties:
Let G be a theory that formally defines execution semantics (domains, contexts, authority).
Let O be any theory of computational behavior.
- If
Omodels computation, thenOrequires execution to occur. - Therefore
Oimplicitly depends onG's primitives (execution must be defined for computation to be theorized). Gdoes not depend onO(execution semantics are primitive, not derived from computational models).
Conclusion:
We cannot derive G from O without circularity:
- Deriving execution semantics from
Owould mean "execution depends on a theory that assumes execution exists" - This creates an impossible circular dependency
- Therefore
Gmust be axiomatic - a foundational primitive that cannot be reduced to other computational theories
Any attempt to make G = O or G ⊆ O fails because O already assumes G's primitives exist.
Author:
- Amlal El Mahrouss - amlal@nekernel.org