We may need a mathematician or perhaps a physicist to
devise a proper module for this purpose. The Infinite
Monkey Protocol Suite obviously considers the use of
subatomic monkeys and monkeys in multiple universes,
hence the need for the I-TAG encoding needed to enumerate
them all.
This problem seems to closely resemble the programming
necessary for quantum computers. Obviously if you need
as many qubits (quantum bits) as there are letters in the
longest document you seek to reproduce, you are in trouble
since science has yet to produce more than a handful of
qubits.
But if you had the use of the 5 qubit computer IBM built
last month, which is basically using five atom-sized
monkeys in multiple universes, you could work on the problem
five bits at a time (should be just enough to pick a character
from the set of capital alphabet letters, the space key,
and a few diacritical marks).
In the
words of the inventor of this quantum computer, words
which little does he realize will soon be immortalized (!)
through Perl and our application of the Infinite Monkey
Protocol Suite,
`A quantum computer could eventually be used for practical
purposes such as database searches -- for example searching the
Web could be sped up a great deal -- but probably not for more
mundane tasks such as word processing,'' said Isaac Chuang, the
IBM researcher who led the team of scientists from IBM, Stanford
University and the University of Calgary.
This open source effort could possibly be funded by a modest
tax of 1/1000 of a penny per monkey provided, including
all universes traversed by the protocol of course. | 