| Display title | Nondeterministic Turing machine |
| Default sort key | NonDeterministic Turing Machine |
| Page length (in bytes) | 12,312 |
| Namespace ID | 0 |
| Page ID | 21935 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | 130 |
| Number of page watchers who visited in the last 30 days | 6 |
| Number of redirects to this page | 7 |
| Counted as a content page | Yes |
| Wikidata item ID | Q1190223 |
| Local description | Theoretical model of computation |
| Central description | may have a set of rules that prescribes more than one action for a given situation; state and tape symbol no longer uniquely specify things; rather, many different actions may apply for the same combination of state and symbol |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | Conversion script (talk | contribs) |
| Date of page creation | 15:51, 25 February 2002 |
| Latest editor | JayBeeEll (talk | contribs) |
| Date of latest edit | 19:33, 13 October 2024 |
| Total number of edits | 267 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |
| Hidden categories (6) | This page is a member of 6 hidden categories (help):
|
| Transcluded templates (74) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
| Background color inline style rule exists without a corresponding text color | 1 |
