The General Theory of General Intelligence: A Pragmatic Patternist Perspective
arXiv:2103.15100
Abstract
A multi-decade exploration into the theoretical foundations of artificial and natural general intelligence, which has been expressed in a series of books and papers and used to guide a series of practical and research-prototype software systems, is reviewed at a moderate level of detail. The review covers underlying philosophies (patternist philosophy of mind, foundational phenomenological and logical ontology), formalizations of the concept of intelligence, and a proposed high level architecture for AGI systems partly driven by these formalizations and philosophies. The implementation of specific cognitive processes such as logical reasoning, program learning, clustering and attention allocation in the context and language of this high level architecture is considered, as is the importance of a common (e.g. typed metagraph based) knowledge representation for enabling "cognitive synergy" between the various processes. The specifics of human-like cognitive architecture are presented as manifestations of these general principles, and key aspects of machine consciousness and machine ethics are also treated in this context. Lessons for practical implementation of advanced AGI in frameworks such as OpenCog Hyperon are briefly considered.
References in corpus (10)
- A Collection of Definitions of Intelligence
- The Consciousness Prior
- Toward a Formal Model of Cognitive Synergy
- A theory of incremental compression
- Symbol Grounding via Chaining of Morphisms
- Artificial general intelligence through recursive data compression and grounded reasoning: a position paper
- Distinction Graphs and Graphtropy: A Formalized Phenomenological Layer Underlying Classical and Quantum Entropy, Observational Semantics and Cognitive Computation
- Folding and Unfolding on Metagraphs
- Paraconsistent Foundations for Probabilistic Reasoning, Programming and Concept Formation
- Patterns of Cognition: Cognitive Algorithms as Galois Connections Fulfilled by Chronomorphisms On Probabilistically Typed Metagraphs