Dimensional Complexity & Algorithmic Efficiency
Open Access
- 1 January 2022
- journal article
- research article
- Published by Scientific Research Publishing, Inc. in International Journal of Modern Nonlinear Theory and Application
- Vol. 11 (01), 1-10
- https://doi.org/10.4236/ijmnta.2022.111001
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.Keywords
This publication has 8 references indexed in Scilit:
- A Primer of Mathematical WritingPublished by American Mathematical Society (AMS) ,2017
- An overview of computational complexityPublished by Association for Computing Machinery (ACM) ,2007
- The Constructive Mathematics of A. A. MarkovThe American Mathematical Monthly, 2006
- Big omega versus the wild functionsACM SIGACT News, 1985
- Big Omicron and big Omega and big ThetaACM SIGACT News, 1976
- The theory of algorithmsAmerican Mathematical Society Translations: Series 2, 1960
- On Computable Numbers, with an Application to the EntscheidungsproblemProceedings of the London Mathematical Society, 1937
- An Unsolvable Problem of Elementary Number TheoryAmerican Journal of Mathematics, 1936