Hello everyone :) I have a question regarding to my independent research relating to OpenCog. I read somewhere (I really don't remember where) that if P = NP <https://en.wikipedia.org/wiki/P_versus_NP_problem> then it would be beneficial to AI in general.
There are science fields which would obviously benefit if P = NP. But my question is: how would specifically OpenCog benefit from that solution? Somehow, it should be a matter of reducing a large number of possible combinations, but I don't really see were would AI fit into this equation. Googling around didn't produce anything interesting, so I'm making a post to this OpenCog community in a hope for an answer. Thank you all for your time, Ivan V. -- You received this message because you are subscribed to the Google Groups "opencog" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/opencog. To view this discussion on the web visit https://groups.google.com/d/msgid/opencog/CAB5%3Dj6W5UhHawabD6NAyT7hEMfkJNCAhd%2BzJcXgFZpJu-MhoMg%40mail.gmail.com. For more options, visit https://groups.google.com/d/optout.
