If a problem can be solved by a Turing acceptor, then the problem is considered computable Non-deterministic Turing Acceptor