A numerical evaluation of the Finite Monkeys Theorem

Stephen Woodcock , Jay Falletta
{"title":"A numerical evaluation of the Finite Monkeys Theorem","authors":"Stephen Woodcock ,&nbsp;Jay Falletta","doi":"10.1016/j.fraope.2024.100171","DOIUrl":null,"url":null,"abstract":"<div><div>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.</div></div>","PeriodicalId":100554,"journal":{"name":"Franklin Open","volume":"9 ","pages":"Article 100171"},"PeriodicalIF":0.0000,"publicationDate":"2024-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Franklin Open","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2773186324001014","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
有限猴子定理的数值评估
无限猴子定理早已证实,一只猴子在打字机上随意按键,最终肯定能复制出威廉-莎士比亚的全部作品。这只考虑了无限极限,即猴子数量无限和/或猴子劳动时间无限。在这里,我们考虑了有限猴子定理,并研究了一个给定字符串由有限数量的猴子之一在有限的时间分配内打出的概率,这与我们对宇宙寿命的估计是一致的。我们还计算了在目标字符串首次产生之前的预期击键次数。考虑到宇宙热死之前的预期时间,我们证明了 "无限猴子定理 "中广为接受的结论在我们的有限宇宙中实际上是误导性的。因此,这将该定理归入一类概率问题或悖论,包括圣彼得堡悖论、芝诺二分法悖论和罗斯-利特尔伍德悖论。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Integrating predictive machine learning with transparent decision-making: A LightGBM–TOPSIS approach to supplier selection Machine learning approaches to predict the stability of smart grid Modeling and analysis of impulsive dispersal of fear effect and hunting cooperation of predator on prey in patchy habitat Developing a novel biquad multifunction filter model and deploying on real-time controllers A hybrid metaheuristic-GAN approach for automated low-dose CT image enhancement
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1