Engineering Commons^™

A Variation On The Zero-One Law, Andreas Blass, Yuri Gurevich, Vladik Kreinovich, Luc Longpre

Departmental Technical Reports (CS)

Given a decision problem P and a probability distribution over binary strings, for each n, draw independently an instance xn of P of length n. What is the probability that there is a polynomial time algorithm that solves all instances xn of P? The answer is: zero or one.