International Journal of Modern Nonlinear Theory and Application

Volume 11, Issue 1 (March 2022)

ISSN Print: 2167-9479   ISSN Online: 2167-9487

Google-based Impact Factor: 0.27  Citations  

Dimensional Complexity and Algorithmic Efficiency

HTML  XML Download Download as PDF (Size: 807KB)  PP. 1-10  
DOI: 10.4236/ijmnta.2022.111001    233 Downloads   1,510 Views  
Author(s)

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.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.