Assembly Theory and its Relationship with Computational Complexity

TL;DR

Assembly theory offers a unique framework for quantifying complexity based on physical assembly processes, contrasting with traditional computational complexity and information theory measures.

Contribution

This paper formally compares assembly theory's measures with classical computational complexity and information measures, highlighting fundamental differences and providing mathematical examples.

Findings

Assembly index is not equivalent to Shannon entropy, Huffman encoding, or Lempel-Ziv-Welch compression.

Assembly index belongs to a different computational complexity class than these compression algorithms.

Assembly theory emphasizes physical observables and causation, differing from abstract computational models.

Abstract

Assembly theory (AT) quantifies selection using the assembly equation and identifies complex objects that occur in abundance based on two measurements, assembly index and copy number, where the assembly index is the minimum number of joining operations necessary to construct an object from basic parts, and the copy number is how many instances of the given object(s) are observed. Together these define a quantity, called Assembly, which captures the amount of causation required to produce objects in abundance in an observed sample. This contrasts with the random generation of objects. Herein we describe how AT's focus on selection as the mechanism for generating complexity offers a distinct approach, and answers different questions, than computational complexity theory with its focus on minimum descriptions via compressibility. To explore formal differences between the two approaches, we show several simple and explicit mathematical examples demonstrating that the assembly index, itself only one piece of the theoretical framework of AT, is formally not equivalent to other commonly used complexity measures from computer science and information theory including Shannon entropy, Huffman encoding, and Lempel-Ziv-Welch compression. We also include proofs that assembly index is not in the same computational complexity class as these compression algorithms and discuss fundamental differences in the ontological basis of AT, and assembly index as a physical observable, which distinguish it from theoretical approaches to formalizing life that are unmoored from measurement.