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