Abstract
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.
Cite
CITATION STYLE
Goertzel, B. (2020). Combinatorial decision dags: a natural computational model for general intelligence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12177 LNAI, pp. 131–141). Springer. https://doi.org/10.1007/978-3-030-52152-3_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
