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.
Share and Cite:
Ngu, A. (2022) Dimensional Complexity and Algorithmic Efficiency.
International Journal of Modern Nonlinear Theory and Application,
11, 1-10. doi:
10.4236/ijmnta.2022.111001.
Cited by
No relevant information.