I would point out that only a dumb ass would actually use monkies and typewriters to prove this point. Even a current computing cluster is vastly faster and would do the same job in a tiny fraction of the time. Throw in quantum computing, which will be commercial in ten years at the outside, and you can sift it in linear time (read: in a fraction of a second) due to the nature of the problem (not all exponential time problems translate to linear time problems on quantum computers, though this one does).
You were the one who claimed that the million monkey example wasn't folklore, not me.
Go ahead, show the math for a massive computer attack at the Shakespeare problem. I've already done so in the link in Post #310, and it shows that your massive computer attack on the problem will still fail, even given BILLIONS of years (which is far too generous as you promised that a demonstration was trivial, and something that takes more than my lifespan is obviously not trivial).
But you won't show the math. You're just going to run around calling names and finally fleeing this debate.
You can't produce an example. You can't post the math.
You've been debunked in post #310, and pretty soon you'll just flee this thread because you can't handle any more mathematical humiliation.
You're toast!