Preprint Article Version 2 This version is not peer-reviewed

On the Salient Limits of Strings of Assembly Theory

Version 1 : Received: 19 September 2024 / Approved: 20 September 2024 / Online: 20 September 2024 (05:20:03 CEST)
Version 2 : Received: 30 September 2024 / Approved: 1 October 2024 / Online: 3 October 2024 (08:55:32 CEST)

How to cite: Bieniawski, W.; Masierak, P.; Łukaszyk, S.; Tomski, A. On the Salient Limits of Strings of Assembly Theory. Preprints 2024, 2024091581. https://doi.org/10.20944/preprints202409.1581.v2 Bieniawski, W.; Masierak, P.; Łukaszyk, S.; Tomski, A. On the Salient Limits of Strings of Assembly Theory. Preprints 2024, 2024091581. https://doi.org/10.20944/preprints202409.1581.v2

Abstract

We consider the formation of strings of any natural radix b within the framework of assembly theory. In particular, we show that the upper bound of the assembly index depends on the radix b both quantitatively and qualitatively, and the longest length N of a string that has the assembly index of N-k is given by N(N-k)=b2+b+3k-2 for k={1,2,3}. We also provide two particular forms of such strings. For k=1 such odd length strings are nearly balanced and there are four such different strings if b=2 and seventy-two if b=3. Since these results are valid also for b=1, assembly theory subsumes information theory.

Keywords

assembly theory; information theory; complexity measures; information entropy; mathematical physics

Subject

Physical Sciences, Mathematical Physics

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


×
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.