**From:** David Picon Alvarez (*eleuteri@myrealbox.com*)

**Date:** Wed Feb 22 2006 - 14:11:37 MST

**Next message:**Eliezer S. Yudkowsky: "Re: Singularity Institute: Likely to win the race to build GAI?"**Previous message:**Ben Goertzel: "Re: ESSAY: Program length, Omega and Friendliness"**In reply to:**Nick Hay: "Re: ESSAY: Program length, Omega and Friendliness"**Next in thread:**Nick Hay: "Re: ESSAY: Program length, Omega and Friendliness"**Reply:**Nick Hay: "Re: ESSAY: Program length, Omega and Friendliness"**Messages sorted by:**[ date ] [ thread ] [ subject ] [ author ] [ attachment ]

From: "Nick Hay" <nickjhay@hotmail.com>

*> We can prove things about programs that can't be referenced in memory,
*

i.e. have

*> complexity >> M, by proving things about program classes they belong to.
*

For

*> example, we can prove that all programs with added dead code behave the
*

same as

*> the original program regardless of the complexity of the dead code. This
*

is OK

*> because the theorem only has to refer to the set of all programs with
*

added dead

*> code, not any particular member of high complexity. As any infinite set
*

(e.g.

*> programs with added dead code) has elements of unbounded complexity we've
*

proved

*> a result about programs of arbitrarily large complexity.
*

I'm not sure if it's possible to prove things about programs of unbounded

complexity, but your example is wrong. Dead code does not raise the

complexity of the program at all. In fact, the applicable definition of

complexity here is the number of bits which the shortest functionally

equivalent program requires.

*> Applying this to AGI, we can use theorems such as "self-modifying system X
*

will

*> remain Friendly regardless of future input" or "self-modifying system X
*

will

*> remain Friendly if future input is in set L" for a sufficiently simple set
*

L.

But the informational complexity altogether can't exceed M.

--David.

**Next message:**Eliezer S. Yudkowsky: "Re: Singularity Institute: Likely to win the race to build GAI?"**Previous message:**Ben Goertzel: "Re: ESSAY: Program length, Omega and Friendliness"**In reply to:**Nick Hay: "Re: ESSAY: Program length, Omega and Friendliness"**Next in thread:**Nick Hay: "Re: ESSAY: Program length, Omega and Friendliness"**Reply:**Nick Hay: "Re: ESSAY: Program length, Omega and Friendliness"**Messages sorted by:**[ date ] [ thread ] [ subject ] [ author ] [ attachment ]

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