Showerthoughts

30821 readers

624 users here now

A "Showerthought" is a simple term used to describe the thoughts that pop into your head while you're doing everyday things like taking a shower, driving, or just daydreaming. The most popular seem to be lighthearted, clever little truths, hidden in daily life.

Here are some examples to inspire your own showerthoughts: 1

Rules

All posts must be showerthoughts
The entire showerthought must be in the title
No politics
- If your topic is in a grey area, please phrase it to emphasize the fascinating aspects, not the dramatic aspects. You can do this by avoiding overly politicized terms such as "capitalism" and "communism". If you must make comparisons, you can say something is different without saying something is better/worse.
- A good place for politics is c/politicaldiscussion
- If you feel strongly that you want politics back, please volunteer as a mod.
Posts must be original/unique
Adhere to Lemmy's Code of Conduct

If you made it this far, showerthoughts is accepting new mods. This community is generally tame so its not a lot of work, but having a few more mods would help reports get addressed a little sooner.

Whats it like to be a mod? Reports just show up as messages in your Lemmy inbox, and if a different mod has already addressed the report the message goes away and you never worry about it.

founded 2 years ago

MODERATORS

[email protected]

461

Monkeys given infinite time would probably get carpal tunnel or form a labor union before typing out Shakespeare. (lemmy.world)

submitted 1 year ago by [email protected] to c/[email protected]

59 comments fedilink hide all child comments

you are viewing a single comment's thread
view the rest of the comments

[–] [email protected] 11 points 1 year ago

Then there is every second a nonzero chance that this machine (assuming true and not pseudo randomness) will pick, say pi.

No. The probability of picking any particular number from a uniform distribution is 0.

On the contrary, since the works of Shakespeare are a finite string over a finite alphabet (I can formalize this argument if you want), the probability of typing them out after some fixed large number of keystrokes is some nonzero number 𝑝. With 𝑛 monkeys, the probability that at least one will type out the works is 1 − (1 − 𝑝)ⁿ, which goes to 1 as 𝑛 → ∞.

Now, you are right that this does not mean that the works are guaranteed to be typed out. However, it has probability 1, so it’s mathematically “almost certain”.