1.

The space complexity of a turing machine is undefined if:

A. It is a multitape turing machine
B. If no string of length n causes T to use infinite number of tape squares
C. If some input of length n causes T to loop forever
D. None of the mentioned
Answer» D. None of the mentioned


Discussion

No Comment Found