 Say that a hypothesis \(H\) from a background set of possible hypotheses \(\mathbf{H}\) is verifiable if there is an evidence sequence such that \(H\) is the only hypothesis from \(\mathbf{H}\) that is consistent with the evidence sequence. For example, in the black raven problem above, the hypothesis “there is a nonblack raven” is verifiable since it is entailed by an observation of a nonblack raven. The hypothesis “all ravens are black” is not verifiable, since it is not entailed by any finite evidence sequence. The following procedure assigns a simplicity rank to each hypothesis \(H\) from a set of hypotheses \(\mathbf{H}\) [Apsitis 1994, Luo and Schulte 2006].