When such an algorithm exists for both a problem and its complement (with the answers "yes" and "no" swapped), the two algorithms can be run simultaneously and repeatedly: run each for a constant number of steps, taking turns, until one of them returns a definitive answer.
Kad takav algoritam postoji za oba problema i njegov komplement(sa odgovorima "da" ili "ne"), dva algoritma se mogu pokrenuti istovremeno više puta: pokrenuti svaki za određen broj koraka, naizmenično, dok jedan od njih ne vraća definitivno tačan odgovor.