Propositional SATisfiability is NP complete. In fact, SAT was the very first problem proved to be NP hard.
AGI logic is generally believed to require more expressive power than propositional logic (for example first-order or higher-order predicate logic). In other words, general intelligence (or human-like thinking) seem to require a knowledge representation more powerful than propositional logic. The human brain can solve reasoning problems using a large number of facts and rules. That itself is an instance of an NP hard problem (ie, inference with FOL or higher, with a large number of formulas). If the human brain can approximate an NP hard problem, that is indication that approximate algorithms for NP-hard exist. But if approximate solutions exist, then it seems natural that we can throw more resources at it to get it closer and closer to exact solutions. It is unlikely that exact solutions would abruptly become impossible. (It has been proven that solving NP-hard problems *approximately* by certain criteria would also imply that P = NP exactly). So, the human brain is evidence that N=NP. ------------------------------------------- AGI Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/21088071-f452e424 Modify Your Subscription: https://www.listbox.com/member/?member_id=21088071&id_secret=21088071-58d57657 Powered by Listbox: http://www.listbox.com
