form the "infinite monkey theorem" to "CAD-monkey theorem"

Starting from the paradoxically theorem about posibilities of complitely random production :

"a monkey hitting keys at random on a typewriter keyboard for an infinite amount of time will almost surely type a given text, such as the complete works of William Shakespeare."

Let's try to continue in this absurd logic to find some relevant considerations about non-linear evolution in creative processes.

The first step will be substitute infinite monkey with infinite calculator...

Then try to build a model case with practical simplifications, such as taking a small poem instead of Shakespear's complete work to manage it with one computer in reasonable times.

The selected poem, the smallest of italian literature, is "Mattino" (morning) by G. Ungaretti.

The whole poem is just one intense verse:

"M'illumino d'immenso"

(I shine myself of inmensity)

Following the thorem's statement the machine should try all possible combinations of alphabetical characters till, randomly, find Ungaretti's poem after n-reitarationsof the combining process.

In this case the total number of possible combinations would be :

20 (poem's lenght) ^ 25 (alphabet+space+') =

33 554 000 000 000 000 000 000 000 000 000 posibilities

maybe it'a a little too much for a simple example (today...)

So the program will fix each letter and step to the next one, that is much easier and...

Here it is:

This browser does not have a Java Plug-in.
Get the latest Java Plug-in here.

Source code: ungaretti

Built with Processing

Anyway here you can find an example of the real theorem, but in an even simpler case, the web considered smallest poem ever, a phrase mis-pronounced by Mohamed Ali sentencing:


a little bit poor we go:

This browser does not have a Java Plug-in.
Get the latest Java Plug-in here.

Source code: poemonkey

Built with Processing