Dimensional Complexity & Algorithmic Efficiency

  title={Dimensional Complexity \& Algorithmic Efficiency},
  author={Alexander Odilon Ngu},
  journal={International Journal of Modern Nonlinear Theory and Application},
  • A. Ngu
  • Published 24 December 2021
  • Computer Science
  • International Journal of Modern Nonlinear Theory and Application
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. 

Figures and Tables from this paper



An Overview of Computational Complexity

What complexity theory provides is an intuitive measurement scheme for an algorithm’s efficiency, but beyond that, it yields results that can tell us that a problem simply does not have an efficient solution.

On computable numbers, with an application to the Entscheidungsproblem

  • A. Turing
  • Computer Science
    Proc. London Math. Soc.
  • 1937
This chapter discusses the application of the diagonal process of the universal computing machine, which automates the calculation of circle and circle-free numbers.

Theory of algorithms

On Parallel Algorithms of some Orthogonal Transforms and the Complexity of Weighted Multi-Constrained Spanning Tree Problems (P. Borowik).

Big omega versus the wild functions

The question of the desirable properties and proper definitions of the Order-of-Magnitude symbols, in particular O and Ø, is addressed once more. The definitions proposed are chosen for

The Incompleteness Theorem

414 NOTICES OF THE AMS VOLUME 53, NUMBER 4 I n September 1930 in Königsberg, on the third day of a symposium devoted to the foundations of mathematics, the young Kurt Gödel launched his bombshell

Big Omicron and big Omega and big Theta

I have recently asked several prominent mathematicians if they knew what ~(n 2) meant, and more than half of them had never seen the notation before, so I decided to search more carefully, and to study the history of O-notation and o-notation as well.

An Unsolvable Problem of Elementary Number Theory

Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use


In 1931, when he was only 25 years of age, the great Austrian logician Kurt Gödel (1906– 1978) published an epoch-making paper [16] (for an English translation see [8, pp. 5–38]), in which he proved

The Constructive Mathematics of A. A. Markov

It was Markov who, in 1931, introduced the concept of an abstract (topological) dynamical system, and his interest in abstract mathematics is represented by series of papers on topology, algebra, analysis, and geometry.

Optimal Reliability Modeling: Principles and Applications

Next, the authors discuss an additive model obtained by replacing the timevarying regression coefŽ cients by constants, and a brief summary of multivariate survival analysis, including measures of association and frailty models.