Turing MachineSo Wikipedia: ‘A Turing machine is an abstract machine In A set of rules (i.e. a
machine) is named an algorithm. If an algorithm is understood (so Wikipedia,
referring to mathematics and computer science) as: a self-contained (bounded
or limited) step-by-step (i.e. quantised) set of operations to be performed,
then a (basic or original) Turing machine is an (non-localised,
i.e. universal) algorithm that can simulate, i.e. copy and so become any
other (secondary, i.e. localised) algorithm whereby
each copy manifests as fractal elaboration of the original (universal) Turing
algorithm. In other words, the secondary algorithm, for instance any one of n
bio-systems, operates merely as the original Turing machine (locally (i.e.
conditionally as determined by alternate rules, so the Buddha)) elaborated. In simplest terms, the
Creative Drive, call it God, Brahman, the Self, functions as universal Turing
Machine that can become any local machine whose (locally determined) rules it
copies. |