universal Turing machine theorem

mathematical theorem in computability theory that there exists a partial two-variable computable function 𝑢 such that, for every one-variable partial computable function 𝑓, an 𝑒 exists such that f(𝑥)≃𝑢(𝑒,𝑥) for all 𝑥

Uses your system voice; voice and rate in settings.

Q7902910Snapshot

≈ 1 min read

Names in other languages

  • eoteoremo de universala Turing-maŝino
  • Englishuniversal Turing machine theorem
  • فارسیقضیه ماشین تورینگ جهانی
  • PortuguêsTeorema MTU
  • УкраїнськаТеорема УМТ
  • 中文UTM定理

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

mathematical theorem in computability theory that there exists a partial two-variable computable function 𝑢 such that, for every one-variable partial computable function 𝑓, an 𝑒 exists such that f(𝑥)≃𝑢(𝑒,𝑥) for all 𝑥

Structured factual content from Wikidata, released under CC0.

References

5 claims could not be tied to a specific sentence and are listed in the table below instead.

    Provenance

    snapshot universal-turing-machine-theorem-889055-949535fccf8a9c9a · hash 949535fccf8a9c9aca958c141f758e798d019c8d059b309f95f35488702547bc · captured 1792311753.4163275 · version history

    Cite this page as: encyclopegia.org, “universal Turing machine theorem”, snapshot universal-turing-machine-theorem-889055-949535fccf8a9c9a. https://encyclopegia.org/a/universal-turing-machine-theorem