| Display title | Universal Turing machine |
| Default sort key | Universal Turing Machine |
| Page length (in bytes) | 22,713 |
| Namespace ID | 0 |
| Page ID | 285650 |
| 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>John Marlo |
| Date of page creation | 21:38, 6 February 2024 |
| Latest editor | imported>John Marlo |
| Date of latest edit | 21:38, 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 computer science, a universal Turing machine (UTM) is a Turing machine capable of computing any computable sequence, as described by Alan Turing in his seminal paper "On Computable Numbers, with an Application to the Entscheidungsproblem". Common sense might say that a universal machine is impossible... |
