 For example, a non-deterministic Turing machine accepts if at least one branch accepts, and rejects only if all branches reject.A co-non-deterministic Turing machine, on the other hand, accepts only if all branches accept, and rejects if any branch rejects.Many classes can be defined in this fashion.