Browse Definitions:
Definition

Infinite Monkey Theorem

Contributor(s): Ivy Wigmore

The Infinite Monkey Theorem is a proposition that an unlimited number of monkeys, given typewriters and sufficient time, will eventually produce a particular text, such as Hamlet or even the complete works of Shakespeare.

The reasoning behind that supposition is that, given infinite time, random input should produce all possible output.The Infinite Monkey Theorem translates to the idea that any problem can be solved, with the input of sufficient resources and time. That idea has been applied in various contexts, including software development and testing, commodity computing, project management and the SETI (the Search for Extraterrestrial Intelligence) project to support a greater allocation of resources -- often, more specifically, a greater allocation of low-end resources -- to solve a given problem. The theorem is also used to illustrate basic concepts in probability.

In 2002, researchers at Plymouth University in the United Kingdom tested the theorem with six crested macaques in a cage with a computer. The monkeys hit the machine with a rock and urinated on it; when they typed, it was mainly the letter "s." However, it should be noted that neither the number of monkeys nor the time allowed for the experiment were infinite.

In 2011, American programmer Jesse Anderson created a software-based infinite monkey experiment to test the theorem. Anderson used his own computer, working with Amazon Elastic Compute Cloud (Amazon EC2) and Hadoop. The virtual monkeys were a million small programs generating random nine-character sequences. When any sequence matched a string of Shakespearean text, that string was checked off. The project finished the complete works in 1.5 months. 

The Million Monkey Project was mostly just for fun, and did not really replicate the theorem's scenario. Nevertheless, Anderson's methods could potentially be applied to real-world problems, such as DNA sequencing

In the early 20th century, Émile Borel, a mathematician, and Sir Arthur Eddington, an astronomer, used the Infinite Monkey Theorem to illustrate timescales implied within statistical mechanics. In popular culture, the theorem has appeared in many works, including Russell Maloney's short story, "Inflexible Logic," Douglas Adam's "Hitchhiker's Guide to the Galaxy" and an episode of the Simpsons.

The IETF's Network Working Group applied the concept in their Infinite Monkey Protocol Suite (RFC 2795), in one of their famous April 1 documents.

 

This was last updated in October 2013

Continue Reading About Infinite Monkey Theorem

Start the conversation

Send me notifications when other members comment.

By submitting you agree to receive email from TechTarget and its partners. If you reside outside of the United States, you consent to having your personal data transferred to and processed in the United States. Privacy

Please create a username to comment.

-ADS BY GOOGLE

File Extensions and File Formats

Powered by:

SearchCompliance

SearchSecurity

  • botnet

    A botnet is a collection of internet-connected devices, which may include PCs, servers, mobile devices and internet of things ...

  • Web application firewall (WAF)

    A Web application firewall (WAF) is a firewall that monitors, filters or blocks traffic to and from a Web application. WAFs are ...

  • MD5

    The MD5 hashing algorithm is a one-way cryptographic function that accepts a message of any length as input and returns as output...

SearchHealthIT

SearchDisasterRecovery

  • call tree

    A call tree -- sometimes referred to as a phone tree -- is a telecommunications chain for notifying specific individuals of an ...

  • mass notification system (MNS)

    A mass notification system is a platform that sends one-way messages to inform employees and the public of an emergency.

  • disaster recovery as a service (DRaaS)

    One approach to a strong disaster recovery plan is DRaaS, where companies offload data replication and restoration ...

SearchStorage

  • secondary storage

    Secondary storage is used to protect inactive data written from a primary storage array to a nonvolatile tier of disk, flash or ...

  • VRAM (video ram)

    VRAM (video RAM) is a reference to any type of random access memory (RAM) used to store image data for a computer display.

  • ZFS

    ZFS is a local file system and logical volume manager created by Sun Microsystems to control the placement, storage and retrieval...

SearchSolidStateStorage

  • SSD RAID (solid-state drive RAID)

    SSD RAID (solid-state drive RAID) is a methodology commonly used to protect data by distributing redundant data blocks across ...

  • Tier 0

    Tier 0 (tier zero) is a level of data storage that is faster, and perhaps more expensive, than any other level in the storage ...

  • PCIe SSD (PCIe solid-state drive)

    A PCIe SSD (PCIe solid-state drive) is a high-speed expansion card that attaches a computer to its peripherals.

SearchCloudStorage

  • RESTful API

    A RESTful application program interface breaks down a transaction to create a series of small modules, each of which addresses an...

  • cloud storage infrastructure

    Cloud storage infrastructure is the hardware and software framework that supports the computing requirements of a private or ...

  • Zadara VPSA and ZIOS

    Zadara Storage provides block, file or object storage with varying levels of compute and capacity through its ZIOS and VPSA ...

Close