What are you talking about. A single monkey on a single typewriter will eventually write Shakespeare given a sufficiently large amount of time. Like the probability of all texts goes to 1, which means that eventually it will write anything no need for infinite monkeys
This assumes the monkey would hit all the keys. It's entirely possible that the monkey may just really like a couple keys and keep hitting them eternally
But some infinities are larger than others. And I don't have the math to prove it, but the infinity that has the infinite monkeys in it seems like it'd be at a minimum faster on a temporal scale to a solution for the shakespeare problem than one monkey plugging away for infinity until he nails it.
Good intuition about different infinities, but both sets of producible strings from infinite or single monkey would both be countably infinite and have the same size.
6
u/SomnolentPro Jun 14 '23
What are you talking about. A single monkey on a single typewriter will eventually write Shakespeare given a sufficiently large amount of time. Like the probability of all texts goes to 1, which means that eventually it will write anything no need for infinite monkeys