Such a machine could solve an NP problem in polynomial time by falling into the correct answer state (by luck), then conventionally verifying it.
Esta máquina podería resolver un problema NP nun tempo polinómico caendo na resposta correcta (por azar), verifícandoa entón.