On Sun, May 11, 2008 at 8:57 PM, Matt Mahoney <[EMAIL PROTECTED]> wrote: > > If a machine P could simulate two other machines Q and R (each with n bits > of memory), then P needs n+1 bits, n to reproduce all the states of Q or > R, and 1 to remember which machine it is simulating. You described a > machine P that can simulate only P. >
You are being obscure again. A machine that I described can simulate any machine of limited size and number of states. Basically, it is a universal machine that can run any other machine, one of which is P, "the machine itself", but other machines are allowed too. Each machine can initiate loading of another machine on the underlying universal machine. -- Vladimir Nesov [EMAIL PROTECTED] ------------------------------------------- agi Archives: http://www.listbox.com/member/archive/303/=now RSS Feed: http://www.listbox.com/member/archive/rss/303/ Modify Your Subscription: http://www.listbox.com/member/?member_id=8660244&id_secret=101455710-f059c4 Powered by Listbox: http://www.listbox.com
