A Variation on the Zero-One Law

Authors

Andreas Blass
Yuri Gurevich
Vladik Kreinovich, The University of Texas at El PasoFollow
Luc Longpre, The University of Texas at El PasoFollow

Publication Date

4-1998

Comments

Technical Report: UTEP-CS-97-24a

Published in Information Processing Letters, 1998, Vol. 67, pp. 29-30.

Abstract

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.