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:
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
The space complexity of a turing machine is undefined if:
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!