From: William Pearson (wil.pearson@gmail.com)
Date: Mon Jun 23 2008 - 12:10:03 MDT
2008/6/23 Peter de Blanc <peter@spaceandgames.com>:
> William Pearson wrote:
>>
>> Which proof are you talking about here?
>
> The one in my first post in my thread, at 6/22/2008 6:23 PM pacific time.
>
>> I am trying to tell you that
>>
>> "Since there are only finitely many machines of complexity K or less"
>>
>> Is incorrect, if you use chaitin or kolmogorov complexity.
>>
>> Will Pearson
>
> According to Wikipedia's definition of Kolmogorov complexity, the statement
> is true.
Please copy/paste the theorems and surrounding text, so it can be
searchable. I'm not seeing it on a cursory glance.
Will Pearson
This archive was generated by hypermail 2.1.5 : Wed Jul 17 2013 - 04:01:03 MDT