A numerical evaluation of the Finite Monkeys Theorem

• The long-established result of the Infinite Monkeys Theorem is correct, but misleading. • Non-trivial text generation during the lifespan of our universe is almost certainly impossible. • The Finite Monkeys case shows there will never be sufficient resources to generate Shakespeare. The Infinite Monkeys Theorem has long-established the eventual certainty of the complete works of William Shakespeare being reproduced by a monkey randomly pressing keys on a typewriter. This only considers the infinite limit, with either an infinite number of monkeys and/or an infinite time period of monkey labour. Here, we consider the Finite Monkeys Theorem and look at the probability of a given string being typed by one of a finite number of monkeys within a finite time allocation consistent with estimates for the lifespan of our universe. We also calculate the expected number of keystrokes until a target string would first be produced. Given the expected time until the heat death of the universe, we demonstrate that the widely-accepted conclusion from the Infinite Monkeys Theorem is, in fact, misleading in our finite universe. As such, this places the theorem in a class of probabilistic problems or paradoxes, including the St. Petersburg paradox, Zeno's dichotomy paradox and the Ross–Littlewood paradox wherein the infinite-resource conclusions directly contradict those obtained when considering limited resources, however sizeable.

Authors

Institutions

Publication Details

Journal
Franklin Open
Published
2024-10-20
DOI
https://doi.org/10.1016/j.fraope.2024.100171
Citations
5
Primary Topic
Primate Behavior and Ecology
Type
article
Field-Weighted Citation Impact
3.22
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A numerical evaluation of the Finite Monkeys Theorem

Stephen Woodcock, Jay Falletta
5 citations
Franklin Open
Primate Behavior and Ecology
3.22
article

A numerical evaluation of the Finite Monkeys Theorem

Stephen Woodcock, Jay Falletta
article en
5 citations

Abstract

• The long-established result of the Infinite Monkeys Theorem is correct, but misleading. • Non-trivial text generation during the lifespan of our universe is almost certainly impossible. • The Finite Monkeys case shows there will never be sufficient resources to generate Shakespeare. The Infinite Monkeys Theorem has long-established the eventual certainty of the complete works of William Shakespeare being reproduced by a monkey randomly pressing keys on a typewriter. This only considers the infinite limit, with either an infinite number of monkeys and/or an infinite time period of monkey labour. Here, we consider the Finite Monkeys Theorem and look at the probability of a given string being typed by one of a finite number of monkeys within a finite time allocation consistent with estimates for the lifespan of our universe. We also calculate the expected number of keystrokes until a target string would first be produced. Given the expected time until the heat death of the universe, we demonstrate that the widely-accepted conclusion from the Infinite Monkeys Theorem is, in fact, misleading in our finite universe. As such, this places the theorem in a class of probabilistic problems or paradoxes, including the St. Petersburg paradox, Zeno's dichotomy paradox and the Ross–Littlewood paradox wherein the infinite-resource conclusions directly contradict those obtained when considering limited resources, however sizeable.

Franklin OpenVol. 9
University of Technology Sydney (AU)
Openalex Percentile: Top 8%
Primate Behavior and Ecology
3.22
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A numerical evaluation of the Finite Monkeys Theorem — Stephen Woodcock, Jay Falletta · Franklin Open (2024) | TGRS Research Map | TGRS