IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i10p1600-d1398113.html
   My bibliography  Save this article

Assembly Theory of Binary Messages

Author

Listed:
  • Szymon Łukaszyk

    (Łukaszyk Patent Attorneys, ul. Głowackiego 8, 40-052 Katowice, Poland)

  • Wawrzyniec Bieniawski

    (Łukaszyk Patent Attorneys, ul. Głowackiego 8, 40-052 Katowice, Poland)

Abstract

Using assembly theory, we investigate the assembly pathways of binary strings (bitstrings) of length N formed by joining bits present in the assembly pool and the bitstrings that entered the pool as a result of previous joining operations. We show that the bitstring assembly index is bounded from below by the shortest addition chain for N , and we conjecture about the form of the upper bound. We define the degree of causation for the minimum assembly index and show that, for certain N values, it has regularities that can be used to determine the length of the shortest addition chain for N . We show that a bitstring with the smallest assembly index for N can be assembled via a binary program of a length equal to this index if the length of this bitstring is expressible as a product of Fibonacci numbers. Knowing that the problem of determining the assembly index is at least NP-complete, we conjecture that this problem is NP-complete, while the problem of creating the bitstring so that it would have a predetermined largest assembly index is NP-hard. The proof of this conjecture would imply P ≠ NP since every computable problem and every computable solution can be encoded as a finite bitstring. The lower bound on the bitstring assembly index implies a creative path and an optimization path of the evolution of information, where only the latter is available to Turing machines (artificial intelligence). Furthermore, the upper bound hints at the role of dissipative structures and collective, in particular human, intelligence in this evolution.

Suggested Citation

  • Szymon Łukaszyk & Wawrzyniec Bieniawski, 2024. "Assembly Theory of Binary Messages," Mathematics, MDPI, vol. 12(10), pages 1-31, May.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:10:p:1600-:d:1398113
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/10/1600/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/10/1600/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Abhishek Sharma & Dániel Czégel & Michael Lachmann & Christopher P. Kempes & Sara I. Walker & Leroy Cronin, 2023. "Assembly theory explains and quantifies selection and evolution," Nature, Nature, vol. 622(7982), pages 321-328, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Likun Cao & Ziwen Chen & James Evans, 2024. "Modularity, Higher-Order Recombination, and New Venture Success," Papers 2405.15042, arXiv.org.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:10:p:1600-:d:1398113. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.