![]() Later an improved scalable version was announced in 2021. In 2016, Nicolas Loizeau created an 8-bit programmable computer pattern, using only four basic parts: a period-60 glider gun, a 90° glider reflector, a p30 glider duplicator, and a glider eater. In 2010, Paul Rendell completed a universal version of his Turing machine pattern, followed in 2011 by a fully universal version, removing the previous requirement (needed for true universality) that the initial Life pattern must have unbounded size and infinite population. This allows data to be stored in linear space, rather than the exponential space that a Register Machine uses. Goucher built a Spartan universal computer-constructor, which has three infinite binary memory tapes (program tape, data tape and marker tape). ![]() In 2002, using Dean Hickerson's sliding block memory, Paul Chapman constructed an implementation of a Minsky Register Machine (a machine of the same capability as a Turing Machine), which he extended to a Universal Register Machine, a finite universal computer. This computer is infinite, as it requires an infinite length of tape for the Turing Machine. In April 2000, Paul Rendell constructed a direct implementation of a Turing machine. The universal computer uses glider logic and a sliding block memory, and the proof of its existence is also outlined in The Recursive Universe. Proving the universality of a cellular automaton with simple rules was in fact Conway's aim in Life right from the start. In 1982, John Conway proved in Winning Ways that the Game of Life has a (finite) universal computer, as well as a universal constructor. 2 Universal computers in other cellular automata.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |