Dimensional Complexity and Algorithmic Efficiency

Alexander Ngu

This paper uses the concept of algorithmic efficiency to present a unified theory of intelligence. Intelligence is defined informally, formally, and computationally. I 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 then used to generate the number line.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment