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

The space complexity of a turing machine is undefined if:(a) It is a m

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» Right choice is (c) If some input of length n causes T to loop forever The best explanation: If there exists an input string of length n that causes T to use an infinite number of tape squares, the space complexity of the turing machine is undefined.