This is actually a good example to explain the concept of undecidability in computation theory. If you get a True you know for sure that the computer is on. If

This is actually a good example to explain the concept of undecidability in computation theory. If you get a True you know for sure that the computer is on. If you don't get anything immediately, it may be that the computer is on but really slow to answer or it may be off and never going to answer. But you'll never be sure, thus its state is undecidable in this case.