Dimensional Complexity & Algorithmic Efficiency

Abstract

This paper uses the concept of algorithmic e ciency to present a uni ed theory of intelligence. Intelligence is de ned informally, formally, and computationally. We introduce the concept of Dimensional complexity in algorithmic e ciency and deduce that an optimally e cient algorithm has zero Time complexity, zero Space complexity, and an in nite Dimensional complexity. This algorithm is used to generate the number line.