AI Chat AI Image Generator AI Video Text to Speech

Dimensional Complexity and Algorithmic Efficiency

12/24/2021

∙

by Alexander Ngu , et al.

∙

∙

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.

research

∙ 07/17/2020

On Algorithms for Solving the Rubik's Cube

In this paper, we present a novel algorithm and its three variations for...

0 Ahmad Kaleem, et al. ∙

research

∙ 12/21/2018

Algorithmic aspects of immersibility and embeddability

We analyze an algorithmic question about immersion theory: for which m, ...

0 Fedor Manin, et al. ∙

research

∙ 02/24/2018

Symmetry and Algorithmic Complexity of Polyominoes and Polyhedral Graphs

We introduce a definition of algorithmic symmetry able to capture essent...

0 Hector Zenil, et al. ∙

research

∙ 02/21/2018

Algorithmic Collusion in Cournot Duopoly Market: Evidence from Experimental Economics

Algorithmic collusion is an emerging concept in current artificial intel...

0 Nan Zhou, et al. ∙

research

∙ 09/19/2023

Recent advances in algorithmic problems for semigroups

In this article we survey recent progress in the algorithmic theory of m...

0 Ruiwen Dong, et al. ∙

research

∙ 12/07/2021

A more efficient algorithm to compute the Rand Index for change-point problems

In this paper we provide a more efficient algorithm to compute the Rand ...

0 Lucas de Oliveira Prates, et al. ∙

research

∙ 08/09/2019

Computing zero-dimensional tropical varieties via projections

We present an algorithm for computing zero-dimensional tropical varietie...

0 Paul Görlach, et al. ∙