Browse Definitions :
Definition

Infinite Monkey Theorem

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

SearchCompliance
  • OPSEC (operations security)

    OPSEC (operations security) is a security and risk management process and strategy that classifies information, then determines ...

  • smart contract

    A smart contract is a decentralized application that executes business logic in response to events.

  • compliance risk

    Compliance risk is an organization's potential exposure to legal penalties, financial forfeiture and material loss, resulting ...

SearchSecurity
  • What is cybersecurity?

    Cybersecurity is the protection of internet-connected systems such as hardware, software and data from cyberthreats.

  • private key

    A private key, also known as a secret key, is a variable in cryptography that is used with an algorithm to encrypt and decrypt ...

  • DOS (disk operating system)

    A DOS, or disk operating system, is an operating system that runs from a disk drive. The term can also refer to a particular ...

SearchHealthIT
SearchDisasterRecovery
  • What is risk mitigation?

    Risk mitigation is a strategy to prepare for and lessen the effects of threats faced by a business.

  • change control

    Change control is a systematic approach to managing all changes made to a product or system.

  • disaster recovery (DR)

    Disaster recovery (DR) is an organization's ability to respond to and recover from an event that affects business operations.

SearchStorage
  • RAID 6

    RAID 6, also known as double-parity RAID, uses two parity stripes on each disk. It allows for two disk failures within the RAID ...

  • RAM (Random Access Memory)

    RAM (Random Access Memory) is the hardware in a computing device where the operating system (OS), application programs and data ...

  • NOR flash memory

    NOR flash memory is one of two types of non-volatile storage technologies.

Close