**From:** William Pearson (*wil.pearson@gmail.com*)

**Date:** Mon Jun 23 2008 - 03:25:44 MDT

**Next message:**Vladimir Nesov: "Re: [sl4] Is there a model for RSI?"**Previous message:**Peter de Blanc: "Re: [sl4] Is there a model for RSI?"**In reply to:**Peter de Blanc: "Re: [sl4] Is there a model for RSI?"**Next in thread:**Peter de Blanc: "Re: [sl4] Is there a model for RSI?"**Reply:**Peter de Blanc: "Re: [sl4] Is there a model for RSI?"**Messages sorted by:**[ date ] [ thread ] [ subject ] [ author ] [ attachment ]

2008/6/23 Peter de Blanc <peter@spaceandgames.com>:

*> William Pearson wrote:
*

*>>
*

*>> Complexity is typically taken to be komogorov complexity that is the
*

*>> complexity of a program is measured by the shortest program that has
*

*>> the same output, There can be infinite programs with the same
*

*>> kolmogorov complexity, as you can always just append arbitrarily long
*

*>> amounts of garbage to a program that does nothing.
*

*>
*

*> That would be the Kolmogorov complexity of a function, rather than a
*

*> program.
*

*>
*

*> The same proof works even if you're interested in functions instead of
*

*> programs, because each program in the sequence implements a distinct
*

*> function.
*

*>
*

Which proof are you talking about here?

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

**Next message:**Vladimir Nesov: "Re: [sl4] Is there a model for RSI?"**Previous message:**Peter de Blanc: "Re: [sl4] Is there a model for RSI?"**In reply to:**Peter de Blanc: "Re: [sl4] Is there a model for RSI?"**Next in thread:**Peter de Blanc: "Re: [sl4] Is there a model for RSI?"**Reply:**Peter de Blanc: "Re: [sl4] Is there a model for RSI?"**Messages sorted by:**[ date ] [ thread ] [ subject ] [ author ] [ attachment ]

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