Yes, probability complicates stuff a bit... I don't know, I never understood why is PLN defined at low level in OpenCog. Sure it's a cool asset, to know probability and confidence of any formula (not to degrade it, PLN surely does have a deal of scientific value), but why low level if AtomSpace is Turing complete. Starting from observation of natural general intelligence in humans, we don't have that specific probability feedback when we are thinking about something. But that doesn't mean we can't calculate it on our own, once we receive an interest stimulus about probability.
For example, if it is about natural language and resolving ambiguities, it could still be done by keeping a sum type in relevant position inside syntax tree that can be analyzed and decided afterwards, again using some non-low-level AtomSpace constructs, even possibly a PLN itself defined in a terms of AtomSpace. But maybe it is my professional deformation to keep things that much simple. - Ivan V. - sri, 5. pro 2018. u 18:40 Ben Goertzel <[email protected]> napisao je: > Also, P=NP is about worst-case complexity, and what matters for AGI is > mainly average-case complexity calculated relative to the probability > distributions characteristic of the environments and problems the AI > system will actually need to deal with... > On Wed, Dec 5, 2018 at 7:50 AM 'Nil Geisweiller' via opencog > <[email protected]> wrote: > > > > On 12/5/18 5:23 PM, Sarah Connorh wrote: > > > Yeah but if P & P are negative ? > > > > Then I'll be back. > > > > Nil > > > > > > > > Le mer. 7 nov. 2018 à 14:19, 'Nil Geisweiller' via opencog > > > <[email protected] <mailto:[email protected]>> a écrit : > > > > > > Hello Ivan, > > > > > > If P = NP it would mean that, given a problem reframed as reasoning > > > such that its solution is a proof p of size s, one could construct > p > > > in a polynomial time of s, which sounds very doubtful. > > > > > > That's in theory, in practice however I think we could make P = NP > for > > > some class of inputs via clever use of meta-learning (such as > > > inference control meta-learning that we're experimenting within > > > opencog, see > > > > https://blog.singularitynet.io/introspective-reasoning-within-the-opencog-framework-1bc7e182827 > ). > > > > > > In fact I had this dream where we could have a sequence of NP > problems > > > and progressively learn how to solve them in P. > > > > > > Obviously for a finite set of inputs, one can turn any complex > > > algorithm into a logarithmic one (think of a pre-calculated binary > > > decision tree, where each branch is a bit describing the input and > > > each leaf is the solution). But it should still be possible to > learn > > > an actual algorithm rather than a finite giant decision tree, that > > > performs worse that log, is more compact, but performs better than > NP > > > for a bunch of real-world problems. > > > > > > Nil > > > > > > On 11/6/18 7:00 PM, Ivan Vodišek wrote: > > > > 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] > > > <mailto:opencog%[email protected]> > > > > <mailto:[email protected] > > > <mailto:opencog%[email protected]>>. > > > > To post to this group, send email to [email protected] > > > <mailto:[email protected]> > > > > <mailto:[email protected] <mailto: > [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 > > > > > > > > > > < > https://groups.google.com/d/msgid/opencog/CAB5%3Dj6W5UhHawabD6NAyT7hEMfkJNCAhd%2BzJcXgFZpJu-MhoMg%40mail.gmail.com?utm_medium=email&utm_source=footer > >. > > > > For more options, visit https://groups.google.com/d/optout. > > > > > > -- > > > 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] > > > <mailto:opencog%[email protected]>. > > > To post to this group, send email to [email protected] > > > <mailto:[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/e1418e0e-8604-2421-0597-4846a7644d3c%40gmail.com > . > > > For more options, visit https://groups.google.com/d/optout. > > > > > > -- > > > 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] > > > <mailto:[email protected]>. > > > To post to this group, send email to [email protected] > > > <mailto:[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/CALJYOy9mgnNF8BX7RxazKYboHyUU2HcYnrMsit8-VY2QQzCzkw%40mail.gmail.com > > > < > https://groups.google.com/d/msgid/opencog/CALJYOy9mgnNF8BX7RxazKYboHyUU2HcYnrMsit8-VY2QQzCzkw%40mail.gmail.com?utm_medium=email&utm_source=footer > >. > > > For more options, visit https://groups.google.com/d/optout. > > > > -- > > 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/9bbd5aca-88bf-2a8c-801c-64c687fb5444%40gmail.com > . > > For more options, visit https://groups.google.com/d/optout. > > > > -- > Ben Goertzel, PhD > http://goertzel.org > > "The dewdrop world / Is the dewdrop world / And yet, and yet …" -- > Kobayashi Issa > > -- > 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/CACYTDBdMOuCDD3PaXzOSNZM%2B8ui-h0PpfMonWUURdYEZKOnjxQ%40mail.gmail.com > . > For more options, visit https://groups.google.com/d/optout. > -- 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%3Dj6VcwTnqqYaq1sDcm_kh%3DHZJ4VQ%3DYcX4N38W9Lc_cLM6Tw%40mail.gmail.com. For more options, visit https://groups.google.com/d/optout.
