Suppose we have a variant of an LBA called a 2LBA that can read cells through where is the length of the input. Is it decidable?
Group of answer choices:
No, because we cannot tell if the 2LBA goes into an infinite loop.
Yes, the same argument as for LBA shows this, except we simulate for a larger, but still finite, number of steps.
No, because we did not learn how to make a decider.
No, by Rice's Theorem.
Yes, because a 2LBA is still not as general as a Turing machine.