Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
94 tokens/sec
Gemini 2.5 Pro Premium
55 tokens/sec
GPT-5 Medium
38 tokens/sec
GPT-5 High Premium
24 tokens/sec
GPT-4o
106 tokens/sec
DeepSeek R1 via Azure Premium
98 tokens/sec
GPT OSS 120B via Groq Premium
518 tokens/sec
Kimi K2 via Groq Premium
188 tokens/sec
2000 character limit reached

Organized Complexity: is Big History a Big Computation? (1609.07111v2)

Published 16 Sep 2016 in cs.OH

Abstract: 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. Keywords: organized complexity, Kolmogorov complexity, logical depth, big history, cosmic evolution, evolution, complexity, complexification, computation, artificial life, philosophy of information

Citations (7)

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Youtube Logo Streamline Icon: https://streamlinehq.com