Organized Complexity: is Big History a Big Computation?

09/16/2016
by   Jean-Paul Delahaye, et al.
0

The concept of "logical depth" introduced by Charles H. Bennett (1988) seems to capture, at least partially, the notion of organized complexity, so central in big history. More precisely, the increase in organized complexity refers here to the wealth, variety and intricacy of structures, and should not be confused with the increase of random complexity, formalized by Kolmogorov (1965). If Bennett is right in proposing to assimilate organized complexity with "computational content", then the fundamental cause of the increase of complexity in the universe is the existence of computing mechanisms with memory, and able to cumulatively create and preserve computational contents. In this view, the universe computes, remembers its calculations, and reuses them to conduct further computations. Evolutionary mechanisms are such forms of cumulative computation with memory and we owe them the organized complexity of life. Language, writing, culture, science and technology can also be analyzed as computation mechanisms generating, preserving and accelerating the increase in organized complexity. The main unifying theme for big history is the energy rate density, a metric based on thermodynamics. However useful, this metric does not provide much insight into the role that information and computation play in our universe. The concept of "logical depth" provides a new lens to examine the increase of organized complexity. We argue in this paper that organized complexity is a valid and useful way to make sense of big history. Additionally, logical depth has a rigorous formal definition in theoretical computer science that hints at a broader research program to quantify complexity in the universe.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/23/2019

Big Math and the One-Brain Barrier A Position Paper and Architecture Proposal

Over the last decades, a class of important mathematical results have re...
research
03/05/2021

Logical foundations: Personal perspective

This is an attempt to illustrate the glorious history of logical foundat...
research
05/14/2020

How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation

Reversible computation opens up the possibility of overcoming some of th...
research
08/13/2020

On the Origin(s) of the Term "Big Data"

I investigate the origin(s) of the term "Big Data," in industry and acad...
research
08/28/2019

Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines

The logical depth of a reversible Turing machine equals the shortest ru...
research
02/04/2023

Computational philosophy of science

Philosophy of science attempts to describe all parts of the scientific p...
research
03/27/2021

Strategically-Motivated Advanced Persistent Threat: Definition, Process, Tactics and a Disinformation Model of Counterattack

Advanced persistent threat (APT) is widely acknowledged to be the most s...

Please sign up or login with your details

Forgot password? Click here to reset