On 4/22/07, Benjamin Goertzel <[EMAIL PROTECTED]> wrote:
Well Matt, there's not only one hard problem!
NL understanding is hard, but theorem-proving is hard too, and
narrow-AI approaches have not succeeded at proving nontrivial theorems
except in very constrained domains...
Verification of sloppy proofs by human mathematicians is also hard
because it needs both these problems almost solved... just a side
note.
-----
This list is sponsored by AGIRI: http://www.agiri.org/email
To unsubscribe or change your options, please go to:
http://v2.listbox.com/member/?member_id=231415&user_secret=fabd7936
