I have been thinking about what a good project to use my new parralella cluster would be and I have come up with something that is complex for the sake of complexity and uses supercomputing for the sake of using super computing. my project idea is to attempt to prove or dissprove the infinite monkey theorem.

Here is a link for more info on the theorem: http://en.wikipedia.org/wiki/Infinite_monkey_theorem

just incase anyone reading is not familliar with it.

My plan is to use a software defined radio to generate a random number from atmopheric noise. each node will query a random number between 0 and 46. it will do this approximately 130,000 times (number of times will be the actual number of charcaters in shakespeers Hamlet, which I still need to count accurately) each integer will be tied to a function of a typewritter key. The results will be dumped in to a text file which will be compared to a copy of hamlet by the head node.

calculations say that there is a probability of one in 3.4 × 10183,946 to get the text right at the first trial. But I would like to test if it would ever actually happen, And if it does happen (which I assume it will) how many attempts were made to get to that point.

If anyone notices any issues with my methodology, care to join me, or just care to comment then I am all ears.