Author: Janosch Zwerensky
Date: 13:28:24 12/23/02
Go up one level in this thread
>I wonder if there is a "real" difference between > >(a) a program that changes itself (even in a big way) >(b) a normal program that has code like "if a then x else if b then y .." > >Theorem: for every program of type a there is program of type b that behaves >exactly the same. I think this is equivalent to the following Theorem: For every program written in assembly language there is a program written in any given turing-complete bytecode language that behaves exactly the same. This is true of course from a mathematical point of view ;). Regards, Janosch
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.