Papers › To be, or not to be, that is the Question: Exploring the pseudorandom generation of...
To be, or not to be, that is the Question: Exploring the pseudorandom generation of texts to write Hamlet from the perspective of the Infinite Monkey Theorem
Ergon Cugler de Moraes Silva
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This article explores the theoretical and computational aspects of the Infinite Monkey Theorem, investigating the number of attempts and the time required for a set of pseudorandom characters to assemble and recite Hamlets iconic phrase, To be, or not to be, that is the Question. Drawing inspiration from Emile Borel's original concept (1913), the study delves into the practical implications of pseudorandomness using Python. Employing Python simulations to generate excerpts from Hamlet, the research navigates historical perspectives and bridges early theoretical foundations with contemporary computational approaches. A set of tests reveals the attempts and time required to generate incremental parts of the target phrase. Utilizing these results, growth factors are calculated, projecting estimated attempts and time for each text part. The findings indicate an astronomical challenge to generate the entire phrase, requiring approximately 2.68×10⁶⁹ attempts and 2.95×10⁶⁶ seconds - equivalent to 8.18×10⁶² hours or 9.32×10⁵⁵ years. This temporal scale, exceeding the age of the universe by 6.75×10e⁴⁵ times, underscores the immense complexity and improbability of random literary creation. The article concludes with reflections on the mathematical intricacies and statistical feasibility within the context of the Infinite Monkey Theorem, emphasizing the theoretical musings surrounding infinite time and the profound limitations inherent in such endeavors. And that only infinity could write Hamlet randomly.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections