**From:** Jordan Stewart (*jordan.r.stewart@gmail.com*)

**Date:** Wed Oct 14 2009 - 01:38:03 MDT

**Next message:**Jordan Stewart: "Re: [sl4] Alan Turing's results are profound"**Previous message:**Robin Lee Powell: "[sl4] Alan Turing's results are profound, but not relevant here."**In reply to:**John K Clark: "[sl4] Alan Turing's results are profound"**Next in thread:**Jordan Stewart: "Re: [sl4] Alan Turing's results are profound"**Reply:**Jordan Stewart: "Re: [sl4] Alan Turing's results are profound"**Messages sorted by:**[ date ] [ thread ] [ subject ] [ author ] [ attachment ]

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.

**Next message:**Jordan Stewart: "Re: [sl4] Alan Turing's results are profound"**Previous message:**Robin Lee Powell: "[sl4] Alan Turing's results are profound, but not relevant here."**In reply to:**John K Clark: "[sl4] Alan Turing's results are profound"**Next in thread:**Jordan Stewart: "Re: [sl4] Alan Turing's results are profound"**Reply:**Jordan Stewart: "Re: [sl4] Alan Turing's results are profound"**Messages sorted by:**[ date ] [ thread ] [ subject ] [ author ] [ attachment ]

*
This archive was generated by hypermail 2.1.5
: Wed Jul 17 2013 - 04:01:05 MDT
*