Advanced
Theory of Computation
Q98 / 100
What is a universal Turing machine?
Correct! Well done.
Incorrect.
The correct answer is B) A TM that takes as input the encoding of another TM M and an input w, and simulates M on w
B
Correct Answer
A TM that takes as input the encoding of another TM M and an input w, and simulates M on w
Explanation
The UTM (Universal Turing Machine) is a single machine that simulates any other TM given its description. It formalizes the concept of a stored-program computer and is central to undecidability proofs.
Progress
98/100