 That principle states that if one sees behavior that is not obviously simple, the behavior will correspond to a computation that is in a sense "maximally sophisticated".Smith's proof has unleashed a debate on the precise operational conditions a Turing machine must satisfy in order for it to be candidate universal machine.A universal (2,3) Turing machine has conceivable applications.