Well we are rebuilding a lot of OpenCog from scratch in the Hyperon initiative...
One of the design goals is to embed as many of the needed cognitive-algorithm-related abstractions as possible in the Atomese 2 language, so that the cognitive algos themselves become brief simple Atomese scripts The theory in this paper is mostly oriented toward figuring out what abstractions are most critical to embed in the Atomese2 interpreter in ways that are both easy-to-use for the developer and highly efficient (in concurrent and distributed processing scenarios) Current OpenCog architecture has all the cognitive algos using Atomspace, and many using the Pattern Matcher and URE Unified Rule Engine, but other than that the algos are using separate code yeah. Hyperon architecture aims to factor out more of the commonalities btw the different cognitive algos, and it seems that baking probabilistic dependent types and metagraph folds/unfolds into the Atomese2 language can be a big step in this direction... ben On Wed, Feb 24, 2021 at 10:08 AM Mike Archbold <[email protected]> wrote: > > In OpenCog the code is kind of compartmentalized -- disparate > algorithms in isolation called as necessary. That has been my > impression at least. But I think in this proposed architecture an > integration is attempted, which makes sense. > > On 2/24/21, Ben Goertzel <[email protected]> wrote: > > "Patterns of Cognition: Cognitive Algorithms as Galois Connections > > Fulfilled by Chronomorphisms On Probabilistically Typed Metagraphs" > > > > https://arxiv.org/abs/2102.10581 > > > > New draft paper that puts various OpenCog cognitive algorithms in a > > common mathematical framework, and connects them with implementation > > strategies involving chronomorphisms on metagraphs... > > > > **** > > It is argued that a broad class of AGI-relevant algorithms can be > > expressed in a common formal framework, via specifying Galois > > connections linking search and optimization processes on directed > > metagraphs whose edge targets are labeled with probabilistic dependent > > types, and then showing these connections are fulfilled by processes > > involving metagraph chronomorphisms. Examples are drawn from the core > > cognitive algorithms used in the OpenCog AGI framework: Probabilistic > > logical inference, evolutionary program learning, pattern mining, > > agglomerative clustering, pattern mining and nonlinear-dynamical > > attention allocation. > > > > The analysis presented involves representing these cognitive > > algorithms as recursive discrete decision processes involving > > optimizing functions defined over metagraphs, in which the key > > decisions involve sampling from probability distributions over > > metagraphs and enacting sets of combinatory operations on selected > > sub-metagraphs. The mutual associativity of the combinatory operations > > involved in a cognitive process is shown to often play a key role in > > enabling the decomposition of the process into folding and unfolding > > operations; a conclusion that has some practical implications for the > > particulars of cognitive processes, e.g. militating toward use of > > reversible logic and reversible program execution. It is also observed > > that where this mutual associativity holds, there is an alignment > > between the hierarchy of subgoals used in recursive decision process > > execution and a hierarchy of subpatterns definable in terms of formal > > pattern theory. > > **** > > > > -- > > Ben Goertzel, PhD > > http://goertzel.org > > > > “He not busy being born is busy dying" -- Bob Dylan -- Ben Goertzel, PhD http://goertzel.org “He not busy being born is busy dying" -- Bob Dylan ------------------------------------------ Artificial General Intelligence List: AGI Permalink: https://agi.topicbox.com/groups/agi/Ta5ed5d0d0e4de96d-M7831411f11981cfc695cf441 Delivery options: https://agi.topicbox.com/groups/agi/subscription
