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 𝑥
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.