Version 1
: Received: 19 September 2024 / Approved: 20 September 2024 / Online: 20 September 2024 (05:20:03 CEST)
How to cite:
Bieniawski, W.; Masierak, P.; Łukaszyk, S. On the Salient Limits of Strings in Assembly Theory. Preprints2024, 2024091581. https://doi.org/10.20944/preprints202409.1581.v1
Bieniawski, W.; Masierak, P.; Łukaszyk, S. On the Salient Limits of Strings in Assembly Theory. Preprints 2024, 2024091581. https://doi.org/10.20944/preprints202409.1581.v1
Bieniawski, W.; Masierak, P.; Łukaszyk, S. On the Salient Limits of Strings in Assembly Theory. Preprints2024, 2024091581. https://doi.org/10.20944/preprints202409.1581.v1
APA Style
Bieniawski, W., Masierak, P., & Łukaszyk, S. (2024). On the Salient Limits of Strings in Assembly Theory. Preprints. https://doi.org/10.20944/preprints202409.1581.v1
Chicago/Turabian Style
Bieniawski, W., Piotr Masierak and Szymon Łukaszyk. 2024 "On the Salient Limits of Strings in Assembly Theory" Preprints. https://doi.org/10.20944/preprints202409.1581.v1
Abstract
We show that the longest length N of a string, composed according to the principles of assembly theory of b different basic symbols, which has the assembly index of N-1 is given by b2+b+1 and this odd-length string is nearly balanced.
Keywords
assembly theory; complexity measures; information entropy; mathematical physics
Subject
Physical Sciences, Mathematical Physics
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
