On Fri, Jan 9, 2009 at 6:34 PM, Matt Mahoney <[email protected]> wrote: > > Well, it is true that you can find |P| < |Q| for some cases of P nontrivially > simulating Q depending on the choice of language. However, it is not true on > average. It is also not possible for P to nontrivially simulate itself > because it is > a contradiction to say that P does everything that Q does and at least one > thing > that Q doesn't do if P = Q. >
What you write above is a separate note unrelated to one about complexity. P simulating P and doing something else is well-defined according to your definition of simulation in the previous message (that includes a special format for request for simulation), no contradictions, and you've got an example. -- Vladimir Nesov ------------------------------------------- agi Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/ Modify Your Subscription: https://www.listbox.com/member/?member_id=8660244&id_secret=123753653-47f84b Powered by Listbox: http://www.listbox.com
