Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Ladderpath Approach: How Tinkering and Reuse Increase Complexity and Information

Version 1 : Received: 16 July 2022 / Approved: 18 July 2022 / Online: 18 July 2022 (09:06:48 CEST)

A peer-reviewed article of this Preprint also exists.

Liu, Y.; Di, Z.; Gerlee, P. Ladderpath Approach: How Tinkering and Reuse Increase Complexity and Information. Entropy 2022, 24, 1082. Liu, Y.; Di, Z.; Gerlee, P. Ladderpath Approach: How Tinkering and Reuse Increase Complexity and Information. Entropy 2022, 24, 1082.

Abstract

The notion of information and complexity are important concepts in many scientific fields such as molecular biology, evolutionary theory, and exobiology. Many measures of these quantities, either rely on a statistical notion of information, are difficult to compute, or can only be applied to strings. Based on assembly theory, we propose the notion of a \textit{ladderpath}, which describes how an object can be decomposed into a hierarchical structure using repetitive elements. From the ladderpath two measures naturally emerge: the ladderpath-index and the order-index, which represent two axes of complexity. We show how the ladderpath approach can be applied to both strings and spatial patterns and argue that all systems that undergo evolution can be described as ladderpaths. Further, we discuss possible applications to human language and the origins of life. The ladderpath approach provides a novel characterization of the information that is contained in a single object (or a system) and could aid in our understanding of evolving systems and the origin of life in particular.

Keywords

Complexity; Syntactic information; Shannon entropy; Kolmogorov complexity; Hierarchy; Module; Origin of life; Alien signal; Language; Evolution

Subject

Physical Sciences, Thermodynamics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.