Here is the first in a series of 3 "OpenCoggish AGI Theory" papers I'm in the midst of writing...
https://arxiv.org/abs/2012.01759 This one just sets up some basic "plumbing" for working with metagraphs (i.e. folds, unfolds and more complex related morphisms on metagraphs, topologies on metagraphs, etc.). There is some close connection w/ Linas's earlier work on sheaves and metagraphs, though pushing in a different direction. The second in the series (currently in process !) will deal with gradual typing systems and uncertain/paraconsistent logics on metagraphs Then the third will make an effort to formulate the various OpenCog cognitive algorithms in a common format using Galois connections on metagraphs .. bringing together the futumorphism / histomorphism stuff with the type-system/logic stuff .... The concepts here are much as in my older notion of "OpenCoggy Probabilistic Programming" but I'm trying to formalize the ideas a little more rigorously here... This is all heavily motivated by Hyperon design/prototyping, i.e. wanting to get a clear understanding of what operations most badly need to be made scalable in Hyperon... ben -- Ben Goertzel, PhD http://goertzel.org “Words exist because of meaning; once you've got the meaning you can forget the words. How can we build an AGI who will forget words so I can have a word with him?” -- Zhuangzhi++ -- 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 view this discussion on the web visit https://groups.google.com/d/msgid/opencog/CACYTDBdqqmnCs1zr%2B5sJEhv9Mek5t_eNdMGKNDQaN38houyasA%40mail.gmail.com.
