I'm currently investigating the problem of theorem proving as an AGI domain, not so much for its own sake as from the following reasoning: AGI needs to learn procedural knowledge, which means program code; and reasoning about program code requires formal logic.
>From a programming viewpoint, formal logic is quite remarkably slippery and messy. Right now I'm trying to formulate it in a sufficiently elegant/orthogonal way that heuristics for guiding proof search can be treated as content, rather than having to be individually wired into the guts of the program. ------------------------------------------- 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
