Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.43K Points
Coach

Q.) A universal Turing machine is a

(A) reprogrammable truing machine
(B) two-tape turing machine
(C) single tape turing machine
(D) none of them
Correct answer : Option (A) - reprogrammable truing machine

Share

Discusssion

Login to discuss.