Home › Entities › mathematical_concept › non-deterministic Turing machine

non-deterministic Turing machine

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
Intangible mathematical_concept Q1190223
Press Enter · cited answer in seconds

non-deterministic Turing machine

Summary

non-deterministic Turing machine is a mathematical concept[1]. It draws 103 Wikipedia views per month (mathematical_concept category, ranking #177 of 1,007).[2]

Key Facts

  • non-deterministic Turing machine's instance of is recorded as mathematical concept[3].
  • Alan Turing is named after non-deterministic Turing machine[4].
  • non-deterministic Turing machine's subclass of is recorded as Turing machine[5].
  • non-deterministic Turing machine's Freebase ID is recorded as /m/05hsk[6].
  • non-deterministic Turing machine's BabelNet ID is recorded as 01488796n[7].
  • non-deterministic Turing machine's Dictionary of Algorithms and Data Structures ID is recorded as nondetermTuringMach[8].
  • non-deterministic Turing machine's Microsoft Academic ID is recorded as 15190523[9].
  • non-deterministic Turing machine's ProofWiki ID is recorded as Definition:Nondeterministic_Turing_Machine[10].
  • non-deterministic Turing machine's PlanetMath ID is recorded as NondeterministicTuringMachine[11].
  • non-deterministic Turing machine's OpenAlex ID is recorded as C15190523[12].

Why It Matters

non-deterministic Turing machine draws 103 Wikipedia views per month (mathematical_concept category, ranking #177 of 1,007).[2] It has Wikipedia articles in 15 language editions, a strong signal of global cultural recognition.[13] It is known by 19 alternative names across languages and contexts.[14]

Related Entities

Alan Turing

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [3] ↑ . wikidata.org.
  2. [4] ↑ . wikidata.org.
  3. [5] ↑ . wikidata.org.
  4. [6] ↑ . Freebase Data Dumps. wikidata.org.
  5. [7] ↑ . BabelNet. wikidata.org.
  6. [8] ↑ . wikidata.org.
  7. [9] ↑ . wikidata.org.
  8. [10] ↑ . wikidata.org.
  9. [11] ↑ . wikidata.org.
  10. [12] ↑ . OpenAlex. Retrieved . docs.openalex.org. Provenance: wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

Aggregate / graph-position facts

  1. [2] ↑ . Wikimedia Foundation. dumps.wikimedia.org.
  2. [13] ↑ . Wikidata sitelinks. wikidata.org.
  3. [14] ↑ . Wikidata aliases. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). non-deterministic Turing machine. Retrieved May 3, 2026, from https://4ort.xyz/entity/non-deterministic-turing-machine
MLA “non-deterministic Turing machine.” 4ort.xyz Knowledge Graph, 4ort.xyz, 3 May. 2026, https://4ort.xyz/entity/non-deterministic-turing-machine.
BibTeX @misc{4ortxyz_non-deterministic-turing-machine_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{non-deterministic Turing machine}}, year = {2026}, url = {https://4ort.xyz/entity/non-deterministic-turing-machine}, note = {Accessed: 2026-05-03}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): non-deterministic Turing machine — https://4ort.xyz/entity/non-deterministic-turing-machine (retrieved 2026-05-03)

Canonical URL: https://4ort.xyz/entity/non-deterministic-turing-machine · Last refreshed: