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...
I happen to think that both can be solved by the same sort of architecture, though... -- Ben G On 4/21/07, Matt Mahoney <[EMAIL PROTECTED]> wrote:
--- Lukasz Stafiniak <[EMAIL PROTECTED]> wrote: > How should an AGI think about formal mathematical ideas? I think the hard problem is in learning how to apply it. For example, suppose you say to an AGI, "Bob and Alice shared a $100 prize. How much did Bob receive?" Mathematically, it is simple, but the problem of converting natural language to mathematical formulas (when appropriate) is unsolved. -- Matt Mahoney, [EMAIL PROTECTED] ----- 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/?&;
----- 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
