**From:** Peter de Blanc (*peter@spaceandgames.com*)

**Date:** Sun Jun 22 2008 - 22:31:31 MDT

**Next message:**J. Andrew Rogers: "Re: [sl4] Is there a model for RSI?"**Previous message:**Krekoski Ross: "Re: [sl4] Is there a model for RSI?"**In reply to:**Matt Mahoney: "Re: [sl4] Is there a model for RSI?"**Next in thread:**J. Andrew Rogers: "Re: [sl4] Is there a model for RSI?"**Reply:**J. Andrew Rogers: "Re: [sl4] Is there a model for RSI?"**Reply:**Krekoski Ross: "Re: [sl4] Is there a model for RSI?"**Messages sorted by:**[ date ] [ thread ] [ subject ] [ author ] [ attachment ]

Matt Mahoney wrote:

*> Nope, the machine can't read its own source code.
*

Doesn't need to. Here's my machine, based on one of the Quine programs

in the Jargon File. The 0 at the end is the machine's model number.

((lambda (x y)

(list x (list (quote quote) x) (+ y 1)))

(quote

(lambda (x y)

(list x (list (quote quote) x) (+ y 1)))) 0)

J. Andrew Rogers wrote:

* > Eh, you might want to double-check your reasoning; it could be picked
*

apart

Then do so.

Krekoski Ross wrote:

* > you can describe the complexity of each descendant with the original
*

code plus an argument stating the number of iterations the program runs

for. There is no change in complexity.

Your first sentence is true, but you're incorrect about there being no

change in complexity. The extra complexity is in the number.

**Next message:**J. Andrew Rogers: "Re: [sl4] Is there a model for RSI?"**Previous message:**Krekoski Ross: "Re: [sl4] Is there a model for RSI?"**In reply to:**Matt Mahoney: "Re: [sl4] Is there a model for RSI?"**Next in thread:**J. Andrew Rogers: "Re: [sl4] Is there a model for RSI?"**Reply:**J. Andrew Rogers: "Re: [sl4] Is there a model for RSI?"**Reply:**Krekoski Ross: "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
*