Dimensional Complexity and Algorithmic Efficiency
Abstract
This paper uses the concept of algorithmic efficiency to present a unified theory of intelligence. Intelligence is defined informally, formally, and computationally. We introduce the concept of Dimensional complexity in algorithmic efficiency and deduce that an optimally efficient algorithm has zero Time complexity, zero Space complexity, and an infinite Dimensional complexity. This algorithm is used to generate the number line.
 Publication:

arXiv eprints
 Pub Date:
 December 2021
 arXiv:
 arXiv:2201.05050
 Bibcode:
 2022arXiv220105050N
 Keywords:

 Computer Science  Other Computer Science;
 Computer Science  Logic in Computer Science
 EPrint:
 10 pages, 7 figures, 1 table