On 02/10/2018 04:55 PM, Ben Goertzel wrote:
Nil, my basic idea here (as we discussed once before) is that the
growth of an exemplar program into various "derived" programs (as
occurs within a MOSES deme) should be executable using a URE rule (or
a small number of URE rules) ....
I am thinking that your recent work on the URE Pattern Miner, should
put you in a position where you can clearly articulate how to use the
URE to implement the growth of a population (deme) of programs from an
exemplar program...
I see. It seems composing the exemplar with codelets (if that's the
right term, I mean small pieces of code) via PutLink, like for the URE
pattern miner, would work.
It would be cool if candidate growth can be seen as proof of its fitness
estimation, which I think might come out naturally of that approach.
Anyway what I am hoping is that you can write a sort of spec for "how
to use the URE to implement the growth of programs from the exemplar
in a MOSES deme" .... if you can viably do this before we meet F2F
in HK in March that would be ideal for spurring discussions and moving
the idea to the next stage...
Sure. Maybe I should prepare a few slides as well, about the URE, its
inference control so far, the URE pattern miner so far, and MOSES
as-it-could-be.
Nil
(A note to others: It is clear that the mechanics of MOSES program
execution will be slower in the (current version of the) Atomspace
than in the current version of MOSES. However, the Atomspace brings
with it other possibilities, including the caching of partially
evaluated results, as well as easier probabilistic modeling as
mentioned above.... And of course we can cook up various schemes for
accelerating Atomspace program execution if we want to. Generally
though I am thinking the value-add of Atomspace-MOSES will occur
mostly for cases where fitness evaluation is highly expensive for
reasons other than having a large number of simple operations carried
out in the program tree, e.g. where the bulk of time that the program
spends is in manipulation of Atoms or manipulation of external data,
in which cases the slower mechanics of program tree evaluation in
Atomspace as opposed to VertexTrees doesn't matter...)
thanks
Ben
thanks
Ben
--
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/4d7fec49-0fa6-71fb-7024-21dc86697b38%40gmail.com.
For more options, visit https://groups.google.com/d/optout.
