| Display title | Wolfram's 2-state 3-symbol Turing machine |
| Default sort key | Wolfram's 2-state 3-symbol Turing machine |
| Page length (in bytes) | 16,021 |
| Namespace ID | 0 |
| Page ID | 304252 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Rtexter1 |
| Date of page creation | 22:51, 6 February 2024 |
| Latest editor | imported>Rtexter1 |
| Date of latest edit | 22:51, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In his book A New Kind of Science, Stephen Wolfram described a universal 2-state 5-symbol Turing machine, and conjectured that a particular 2-state 3-symbol Turing machine (hereinafter (2,3) Turing machine) might be universal as well.
On May 14, 2007, Wolfram announced a $25,000 prize to be won by the... |
