Question
In an automata or formal-language problem, which option best represents Universal Turing Machine?
Select an option. Your answer will be checked instantly.
Correct Answer: A. a Turing machine that can simulate other Turing machines from their encodings
Explanation:
In this course context, Universal Turing Machine means a Turing machine that can simulate other Turing machines from their encodings.
Leave a Reply