Why an unlikely passage eventually appears
The theorem is about a particular finite string—a sentence, paragraph, or even a complete book—not about producing meaningful writing in general. Imagine a typist choosing each character independently from a fixed keyboard, with every key equally likely. If the target passage has 100 characters, one attempt to match it has a probability of 1 in the number of possible 100-character sequences. That probability may be fantastically small, but it is not zero.
The role of endless attempts
A simple way to see the result is to divide the typist’s output into blocks the length of the target. Each block has the same tiny chance of matching. If that chance is p, the chance that n blocks all miss is (1 − p)ⁿ. As n grows without limit, that miss probability approaches zero. So the chance of seeing the target approaches one—a mathematical meaning often summarized as “almost certain.”
That does not mean a match is guaranteed within any practical span of time. For a long passage, the expected wait can dwarf the age of the universe; infinity, not speed, makes the argument work.
What the theorem does—and doesn’t—say
Under these assumptions, an infinite random stream will contain every finite string over the chosen character set, including passages no one intended to write. But the theorem does not say that randomness tends to organize itself into a coherent book: it says that any specified finite passage will occur somewhere, given enough independent chances. The striking consequence is that a perfect copy can appear without understanding or authorship—while the odds offer no reason to expect it before the wait becomes literally unbounded.
