Assuming the conjecture that probabilistic polynomial time (BPP) equals deterministic polynomial time (P), the word 'probabilistic' is optional in the complexity-theoretic Church–Turing thesis.
Forudsat formodningen at probabilistisk polynomiel tid (BPP) er lig deterministisk polynomiel tid (P), er ordet 'probabilistisk' valgfrit i den stærke Church-Turing-tese.