Turing machine
The Turing machine is, as its name suggests, a pattern that is capable of turing-complete computation. It was created by Paul Rendell and its construction was completed on April 2, 2000. This particular Turing machine is infinite, as it requires an infinite length of tape to perform arbitrary computations. On February 10, 2010 the Turing machine was extended into a universal Turing machine and can itself be simulated within it.
| Turing machine | |||||
| |||||
| View static image | |||||
| Pattern type | Miscellaneous | ||||
|---|---|---|---|---|---|
| Number of cells | 36549 | ||||
| Bounding box | 1714×1647 | ||||
| Discovered by | Paul Rendell | ||||
| Year of discovery | 2000 | ||||
| |||||
Image gallery
 High-resolution image of the Turing machine |
gollark: Well, don't do that.
gollark: Oh bee, networkoids.
gollark: Oh bee, networkoids.
gollark: Kind of.
gollark: Kind of.
See also
- Fully universal Turing machine
- Universal turing machine
- Universal computer
- Universal constructor
External links
- Turing machine at the Life Lexicon
- A Turing Machine in Conway's Game of Life - Official site by Paul Rendell
This article is issued from Conwaylife. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.