consider the problem of determining whether a given state in a turing machine is useless. formulate this problem as a language and show that it's undecidable.