Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

searching for Probabilistic Turing machine 2 found (54 total)

alternate case: probabilistic Turing machine

Toda's theorem (428 words) [view diff] exact match in snippet view article find links to article

The polynomial hierarchy is contained in probabilistic Turing machine in polynomial time
Yao's test (429 words) [view diff] exact match in snippet view article find links to article
collection used in the above definition can be replaced by a probabilistic Turing machine, working in polynomial time. This also yields a strictly stronger