Given a decision problem P and a probability distribution over binary
strings, for each it, draw independently an instance x(n) of P of leng
th n. What is the probability that there is a polynomial time algorith
m that solves all instances x(n) of P? The answer is: zero or one. (C)
1998 Elsevier Science B.V. All rights reserved.