of monkeys at typewriters, eventually one will bash out the script

for Hamlet." (One may also hypothesize a small number of monkeys

and a very long period of time.) This theorem asserts nothing about

the intelligence of the one {random} monkey that eventually

comes up with the script (and note that the mob will also type out

all the possible *incorrect* versions of Hamlet). It may be

referred to semi-seriously when justifying a {brute force}

method; the implication is that, with enough resources thrown at

it, any technical challenge becomes a {one-banana problem}.

This theorem was first popularized by the astronomer Sir Arthur

Eddington. It became part of the idiom of through the classic short

story "Inflexible Logic" by Russell Maloney, and many younger

hackers know it through a reference in Douglas Adams's

"Hitchhiker's Guide to the Galaxy".

-- The AI Hackers Dictionary

- Infinite-Monkey Theorem n.
"If you put an infinite
number of monkeys at typewriters, eventually one will bash out the
script for Hamlet.

(One may also hypothesize a small number of monkeys and a very long period of time.... - one-banana problem: n. At mainframe shops, where the computers
have operators for routine administrivia

he programmers and hardware people tend to look down on the operators and claim that a trained monkey could do their job.... - Ford, there's an infinite number of monkeys out here who wish to talk to us
about this script for Hamlet they've worked up.

-- Arthur De... - brute force adj.
Describes a primitive programming style

one in which the programmer relies on the computer's processing power instead of using his or her own intelligence to simplify the problem, often ignoring problems of scale and applying naive methods suited to small problems directly to large ones.... - one-banana problem n.
At mainframe shops, where the
computers have operators for routine administrivia

he programmers and hardware people tend to look down on the operators and claim that a trained monkey could do their job.... - There is a special department of Hell for students of probability.

In it there are an infinite number of monkeys and typewriters.... - banana problem: n. [from the story of the little girl who said "I
know how to spell `banana', but I don't know when to stop"].

Not knowing where or when to bring a production to a close (compare {fencepost error}).... - consult guide about the Hitchhiker's Guide to the Galaxy
The Guide checks through its Sub-Etha-Net database and eventually comes up
with the following entry

The Hitchhiker's Guide is a wholly remarkable product.... - HAKMEM /hak'mem/ n.
MIT AI Memo 239 (February 1972).

A legendary collection of neat mathematical and programming hacks contributed by many people at MIT and elsewhere....