No, it doesn't justify ad-hoc, even when perfect solution is
impossible, you could still have an optimal approximation under given
limitations.
So what is an optimal approximation under uncertainty? How do you know when
you've gotten there?
If you don't believe in ad-hoc then you must have an algorithmic solution .
. . .
Numerous scientific studies show that humans frequently under- and
over-think problems and data collection. Tell us your solution for fixing
this.
----- Original Message -----
From: "Vladimir Nesov" <[EMAIL PROTECTED]>
To: <[email protected]>
Sent: Friday, October 24, 2008 5:03 PM
Subject: **SPAM** Re: [agi] If your AGI can't learn to play chess it is no
AGI
On Sat, Oct 25, 2008 at 12:54 AM, Matt Mahoney <[EMAIL PROTECTED]>
wrote:
AIXI says that a perfect solution is not computable. [...]
It justifies our current ad-hoc approach to problem solving -- we have no
choice.
No, it doesn't justify ad-hoc, even when perfect solution is
impossible, you could still have an optimal approximation under given
limitations.
--
Vladimir Nesov
[EMAIL PROTECTED]
http://causalityrelay.wordpress.com/
-------------------------------------------
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/?&;
Powered by Listbox: http://www.listbox.com
-------------------------------------------
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=117534816-b15a34
Powered by Listbox: http://www.listbox.com
