Re: PAPER: Theory of Universal AI based on Algorithmic Complexity

From: Mitchell Porter (
Date: Sun Apr 15 2001 - 18:07:57 MDT

An identical-looking paper by this author
click on his name to see others) inspired
the second of my "six theses on superintelligence"
The main problem with his optimal AI is that
in its idealized form, it is noncomputable,
and even its resource-bounded form, it still
scales horribly (see second comment under
"Outlook"). This is because it's meant to
deal with every possible environment, so it
runs afoul of no-free-lunch theorems. What
interests me is whether these concepts can
illuminate 'specialized AI' that works with
domain-specific representations and algorithms.

--- James Rogers <> wrote:

Do You Yahoo!?
Get email at your own domain with Yahoo! Mail.

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