Advanced
Theory of Computation
Q85 / 100
What is an oblivious Turing machine and why is it important for complexity?
Correct! Well done.
Incorrect.
The correct answer is B) A TM whose head movement depends only on the step number and input length (not content), useful for proving simulation theorems with constant overhead
B
Correct Answer
A TM whose head movement depends only on the step number and input length (not content), useful for proving simulation theorems with constant overhead
Explanation
Oblivious TMs can be simulated by circuits and are used in proofs relating time complexity to circuit complexity (e.g., NC, P/poly). Any TM can be made oblivious with O(T log T) slowdown.
Progress
85/100