Order, organization, and randomness: on the mathematical formulation of life

Life increasingly is understood in terms of information. I consider two attempts to formulate life in terms of mathematical information theory. G. J. Chaitin’s proposes to define life in terms of the relation between organization and algorithmic compressibility in biological information. More recently, William Dembski, Winston Ewart, and Robert J. Marks suggest that Dembski’s notion of specified complexity can be mathematically expressed in information-theoretic terms through the concept of algorithmic specified complexity. The mathematical approaches are similar and in both cases essentially dependent on the concept of randomness deficiency in algorithmic information theory: to subtract out the degree of randomness from an informational measure, yielding a remainder of organization (Chatin) or specified complexity (Dembski, Ewart, and Marks). I argue that these attempts must fail due the information-theoretic indistinguishability of organization and randomness. The failure is instructive, however, because it illustrates the inability of mathematical information theory to register biological organization.

Authors

Institutions

Publication Details

Journal
Synthese
Published
2024-11-19
DOI
https://doi.org/10.1007/s11229-024-04806-6
Primary Topic
Computability, Logic, AI Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Order, organization, and randomness: on the mathematical formulation of life

Joseph K. Cosgrove
Synthese
Computability, Logic, AI Algorithms
article

Order, organization, and randomness: on the mathematical formulation of life

Joseph K. Cosgrove
article en

Abstract

Life increasingly is understood in terms of information. I consider two attempts to formulate life in terms of mathematical information theory. G. J. Chaitin’s proposes to define life in terms of the relation between organization and algorithmic compressibility in biological information. More recently, William Dembski, Winston Ewart, and Robert J. Marks suggest that Dembski’s notion of specified complexity can be mathematically expressed in information-theoretic terms through the concept of algorithmic specified complexity. The mathematical approaches are similar and in both cases essentially dependent on the concept of randomness deficiency in algorithmic information theory: to subtract out the degree of randomness from an informational measure, yielding a remainder of organization (Chatin) or specified complexity (Dembski, Ewart, and Marks). I argue that these attempts must fail due the information-theoretic indistinguishability of organization and randomness. The failure is instructive, however, because it illustrates the inability of mathematical information theory to register biological organization.

SyntheseVol. 204(6)
Providence College (US)
Openalex Percentile: Top 75%
Computability, Logic, AI Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.