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
I got this question during an online interview.
Question is taken from Class RP and ZPP,Complexity in division Other Classes Of Problems of Automata Theory