Combinatorial Decision Dags: A Natural Computational Model for General Intelligence

04/11/2020
by   Ben Goertzel, et al.
6

A novel computational model (CoDD) utilizing combinatory logic to create higher-order decision trees is presented. A theoretical analysis of general intelligence in terms of the formal theory of pattern recognition and pattern formation is outlined, and shown to take especially natural form in the case where patterns are expressed in CoDD language. Relationships between logical entropy and algorithmic information, and Shannon entropy and runtime complexity, are shown to be elucidated by this approach. Extension to the quantum computing case is also briefly discussed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/30/2023

Unified Information Dynamic Analysis of Quantum Decision-Making and Search Algorithms: Computational Intelligence Measure

There are important algorithms built upon a mixture of basic techniques ...
research
11/25/2015

Unifying Decision Trees Split Criteria Using Tsallis Entropy

The construction of efficient and effective decision trees remains a key...
research
12/03/2021

Introduction to Logical Entropy and its Relationship to Shannon Entropy

We live in the information age. Claude Shannon, as the father of the inf...
research
03/23/2022

Computational Language β based on Orthomodular Lattices with the Non-distributivity of Quantum Logic

It is argued that transformation processes (generation rules) showing ev...
research
12/14/2016

Computational Intelligence: are you crazy? Since when has intelligence become computational?

Computational Intelligence is a dead-end attempt to recreate human-like ...
research
04/09/2015

Ultimate Intelligence Part II: Physical Measure and Complexity of Intelligence

We continue our analysis of volume and energy measures that are appropri...

Please sign up or login with your details

Forgot password? Click here to reset