A Computational Path to the Nilpotent Dirac Equation

Using a rewrite approach we introduce a computational path to a nilpotent form of the Dirac equation. The system is novel in allowing new symbols to be added to the initial alphabet and starts with just one symbol, representing 'nothing', and two fundamental rules: create, a process which adds news symbols, and conserve, a process which examines the effect of any new symbol on those that currently exist. With each step a new sub-alphabet of an infinite universal alphabet is created. The implementation may be iterative, where a sequence of algebraic properties is required of the emerging subalphabets. The path proceeds from nothing through conjugation, complexification, and dimensionalisation to a steady (nilpotent) state in which no fundamentally new symbol is needed. Many simple ways of implementing the computational path exist.