Dimensional Complexity and Algorithmic Efficiency
Other Computer Science
2022-03-14 v3 Logic in Computer Science
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.
Cite
@article{arxiv.2201.05050,
title = {Dimensional Complexity and Algorithmic Efficiency},
author = {Alexander Ngu},
journal= {arXiv preprint arXiv:2201.05050},
year = {2022}
}
Comments
10 pages, 7 figures, 1 table