A Review of Methods for Estimating Algorithmic Complexity: Options, and Challenges

03/24/2020
by   Hector Zenil, et al.
0

I review previous and novel techniques in the field of applications of algorithmic (Kolmogorov) complexity starting from those dominating the area such as statistical lossless compression algorithms to more recent approaches that advance and complement those based on statistical compression but also bring new challenges and have their own limitations. I present evidence suggesting that different methods complement each other for different regimes. I also make the case that despite the many challenges, some methods can be better motivated by and better grounded in the principles of algorithmic complexity theory. I will explain how different approaches to algorithmic complexity can explore the relaxation of different necessary and sufficient conditions in their exploration of numerical applicability with some of those approaches taking greater risks than others in exchange for application relevancy. I conclude with a discussion of possible directions that may be taken to advance the area and encourage methodological innovation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/24/2020

A Review of Methods for Estimating Algorithmic Complexity and Beyond: Options, and Challenges

I review previous and novel techniques in the field of applications of a...
research
03/24/2020

A Review of Methods for Estimating Algorithmic Complexity and Beyond: Options, Challenges, and New Directions

I review previous and novel techniques in the field of applications of a...
research
03/24/2020

A Review of Methods for Estimating Algorithmic Complexity: Options, Challenges, and New Directions

Established and novel techniques in the field of applications of algorit...
research
02/24/2018

Symmetry and Algorithmic Complexity of Polyominoes and Polyhedral Graphs

We introduce a definition of algorithmic symmetry able to capture essent...
research
06/01/2017

Paths to Unconventional Computing: Causality in Complexity

I describe my path to unconventionality in my exploration of theoretical...
research
09/15/2021

A Computable Piece of Uncomputable Art whose Expansion May Explain the Universe in Software Space

At the intersection of what I call uncomputable art and computational ep...
research
05/19/2023

"Schöne neue Lieferkettenwelt": Workers' Voice und Arbeitsstandards in Zeiten algorithmischer Vorhersage

The complexity and increasingly tight coupling of supply chains poses a ...

Please sign up or login with your details

Forgot password? Click here to reset