From: Jordan Stewart (email@example.com)
Date: Wed Oct 14 2009 - 01:46:37 MDT
On Wed, Oct 14, 2009 at 8:38 PM, Jordan Stewart
> 1. Given a finite alphabet,
> 2. Given an infinite number of programs,
> 3. A program being able to consist of any number of instructions,
> 4. A subset of the programs in 2. consisting solely of output instructions,
> 5. The subset in 5., being itself infinite,
> 6. The subset in 5. produces all possible output permutations.
In other words, the infinite monkey theorem.
(Although I'm not quite sure why 1. is in there- perhaps because my brain
refused to cope with quite so many infinite axes . . .)
This archive was generated by hypermail 2.1.5 : Sat May 18 2013 - 04:01:14 MDT