You aren't attempting to disprove what I said. Within a finite set of characters within the generated characters there is a finite number of combinations. Who cares what is typed before and after we just care that a certain number of characters matches the book.
Let me re-word this: You say there is an infinite number of combinations the generator can type which is true, but only because the number of characters it types is infinite. If I'm saying a particular book has 10,000 characters and we are looking for a match in the generated characters we would be continually looking for sets of 10,000 consecutive characters to see if it matched. Within that number of characters there is a finite number of ways they could be arranged.
Given that the generator is generating characters at random, one of these consecutive groups will eventually "almost certainly" match
Repeating again that there are infinite combinations going on for eternity doesn't confront this issue.
shakespear's shortest play is around 80,000 letters.
and what i am trying to say is that it doesnt matter if you look at sets of 10,000 characters or 80,000
what you are proposing we do, is look for a match. that is what the goal was from the beggining(for you). to find a match of hamlet generated by the randomizer. this changes nothing. you are simply stating that we can look for a match in the infinite block of mash.
there are going to be infinite sets of 80,000 characters. look at them all you want. this doesnt mean or prove anything.
you are not understanding that there are infinite ways for these 1000 generators to continue forever without creating hamlet. nothing is guarenteed to occur.