Turing The Binary World
A Turing machine is a hypothetical machine theorized and created by the mathematician Alan Turing in 1936. Despite its simplicity, the machine can simulate ANY computer algorithm, no matter how complicated!
The Turing Machine – One Step At A Time
This device can do anything a Dell or HP computer can – eventually. And if it is running at Planck-clock speeds, it has plenty of “time.” There are a number of basic models that can function as Turing engines, the one in this illustration has a stationary head, and is therefore suitable to act as the engine of Time operating against the “tape” that is the Quantum Hologram. To explain the device, here are a couple useful videos:
A Turing machine In The Classic Style
The Turning machine demonstrates programmed sequencing in a manner that could (my off-the-wall ideas again) relate to the methodology used by our DNA. The concept, suitably coded, could describe how we actually develop living cells. (Or not…) Here is an example showing the similarities. (To quote the aphorism, “As above, so below…”)
There is a huge step from the simple machine to the complexity of genetic science, but the processes seem to be quite compatible.
If you are looking for possibilities, methods and ideas that expand on these discoveries and perhaps offer some ideas to explain natural processes like long-scale evolution, try the Extra Credit material, starting with a discussion of Information Theory and the OSI Model
If you would rather get to the meat, you should probably start with understanding the Quantum Hologram