Research Article | | Peer-Reviewed

Ways to Estimate the Minimal Specified Complexity of Reproduction

Received: 7 November 2025     Accepted: 22 November 2025     Published: 11 December 2025
Views:       Downloads:
Abstract

Because of the difficulty of estimating the complexity of biological reproduction of even the simplest cell, the minimal complexities of several simpler self-replicating systems are computed. These include viruses (both biological and computer, which require additional complex resources to replicate). Also considered are a proposed self-reproducing factory and two conceptual self-replicators. Because even some of those are difficult to evaluate, very, very low bounds are computed. Still, in all cases, the minimal complexities are enormous-more than all the quantum state changes in the entire history of the whole known universe in all time. Therefore, because biological reproduction is more complex, all origin-of-life proposals, including RNA hypotheses toward the first self-reproducing cell, must demonstrate how at least such minimal complexity could have accumulated beyond using simply trial-and-error.

Published in Computational Biology and Bioinformatics (Volume 13, Issue 2)
DOI 10.11648/j.cbb.20251302.14
Page(s) 72-83
Creative Commons

This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.

Copyright

Copyright © The Author(s), 2025. Published by Science Publishing Group

Keywords

Reproduction, Self-replication, Specified Complexity

References
[1] Von Neumann, J. Burks, A. W. Theory of Self-Reproducing Automata; Univ. of Illinois Press, Urbana, 1966.
[2] Fox News, This New 3-D Printer Can Print Its Own Parts; May 23, 2016;
[3] Ludwig, M. A. Computer Viruses, Artificial Life; and Evolution; American Eagle Publishers, Tucson, AZ, 1993.
[4] Marks, R. J., Dembski, W. A., Ewert, W. Introduction to Evolutionary Informaticsˆ, chapter 6, p 243; World Scientific Publishing, New Jersey, 2017.
[5] Dembski, W. Design Inference, Cambridge University Press, Cambridge, UK, 1998, p 209.
[6] Almehdi, A. M., et al. SARS-CoV-2 spike protein: pathogenesis, vaccines, and potential therapies, 2021 Oct; 49(5): 855-876.
[7] Wikipedia, Phi X 174, accessed 2025/8/15
[8] Pesavento, U. An Implementation of von Neumann’s Self-Reproducing Machine, Princeton University. Princeton, NJ, 2000.
[9] Freitas, R. A., Gilbreath, W. P. (Eds.). Advanced automation for space missions. NASA Conference Publication 2255. NASA Scientific and Technical Information Branch, 1980.
[10] Freitas, R. A. Jr, Merkle, R. C. Kinematic Self-Replicating Machines; Landes Bioscience, Georgetown, TX, 2004;
[11] Mignea; A. Developing Insights into the Design of the Simplest Self-Replicator and its Complexity: Part 2-Evaluating the Complexity of a Concrete Implementation of an Artificial SSR; Engineering and the Ultimate, ed. Jonathan Bartlett, et al, Proceedings of the 2021 Conference on Engineering and Metaphysics, Blyth Institute Press, Broken Arrow, OK.
[12] Mizuuchi, R., Furubayashi, T. & Ichihashi, N. Evolutionary transition from a single RNA replicator to a multiple replicator network. Nat Commun 13, 1460 (2022).
[13] Cohen, F. Computer viruses: Theory and experiments. Computers & Security, 6(1), 1987, 22-35.
[14] Freitas, R. A. Jr, Zachary, W. B. A Self-Replicating, Growing Lunar Factory; Proceedings of the Fifth Princeton/AIAA Conference, May 18-21, 1981, Jerry Grey and Lawrence A. Hamdan (Eds.), p 24;
[15] Rasmussen, S., Bedau, M. A., Chen, L., Deamer, D., Krakauer, D. C., Packard, N. H., Stadler, P. F. Transitions from nonliving to living matter. Science, 303(5660) 2001, 963-965.
Cite This Article
  • APA Style

    Schulz, W. (2025). Ways to Estimate the Minimal Specified Complexity of Reproduction. Computational Biology and Bioinformatics, 13(2), 72-83. https://doi.org/10.11648/j.cbb.20251302.14

    Copy | Download

    ACS Style

    Schulz, W. Ways to Estimate the Minimal Specified Complexity of Reproduction. Comput. Biol. Bioinform. 2025, 13(2), 72-83. doi: 10.11648/j.cbb.20251302.14

    Copy | Download

    AMA Style

    Schulz W. Ways to Estimate the Minimal Specified Complexity of Reproduction. Comput Biol Bioinform. 2025;13(2):72-83. doi: 10.11648/j.cbb.20251302.14

    Copy | Download

  • @article{10.11648/j.cbb.20251302.14,
      author = {Waldean Schulz},
      title = {Ways to Estimate the Minimal Specified Complexity of Reproduction},
      journal = {Computational Biology and Bioinformatics},
      volume = {13},
      number = {2},
      pages = {72-83},
      doi = {10.11648/j.cbb.20251302.14},
      url = {https://doi.org/10.11648/j.cbb.20251302.14},
      eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.cbb.20251302.14},
      abstract = {Because of the difficulty of estimating the complexity of biological reproduction of even the simplest cell, the minimal complexities of several simpler self-replicating systems are computed. These include viruses (both biological and computer, which require additional complex resources to replicate). Also considered are a proposed self-reproducing factory and two conceptual self-replicators. Because even some of those are difficult to evaluate, very, very low bounds are computed. Still, in all cases, the minimal complexities are enormous-more than all the quantum state changes in the entire history of the whole known universe in all time. Therefore, because biological reproduction is more complex, all origin-of-life proposals, including RNA hypotheses toward the first self-reproducing cell, must demonstrate how at least such minimal complexity could have accumulated beyond using simply trial-and-error.},
     year = {2025}
    }
    

    Copy | Download

  • TY  - JOUR
    T1  - Ways to Estimate the Minimal Specified Complexity of Reproduction
    AU  - Waldean Schulz
    Y1  - 2025/12/11
    PY  - 2025
    N1  - https://doi.org/10.11648/j.cbb.20251302.14
    DO  - 10.11648/j.cbb.20251302.14
    T2  - Computational Biology and Bioinformatics
    JF  - Computational Biology and Bioinformatics
    JO  - Computational Biology and Bioinformatics
    SP  - 72
    EP  - 83
    PB  - Science Publishing Group
    SN  - 2330-8281
    UR  - https://doi.org/10.11648/j.cbb.20251302.14
    AB  - Because of the difficulty of estimating the complexity of biological reproduction of even the simplest cell, the minimal complexities of several simpler self-replicating systems are computed. These include viruses (both biological and computer, which require additional complex resources to replicate). Also considered are a proposed self-reproducing factory and two conceptual self-replicators. Because even some of those are difficult to evaluate, very, very low bounds are computed. Still, in all cases, the minimal complexities are enormous-more than all the quantum state changes in the entire history of the whole known universe in all time. Therefore, because biological reproduction is more complex, all origin-of-life proposals, including RNA hypotheses toward the first self-reproducing cell, must demonstrate how at least such minimal complexity could have accumulated beyond using simply trial-and-error.
    VL  - 13
    IS  - 2
    ER  - 

    Copy | Download

Author Information
  • Independent Researcher, Spokane, United States

  • Sections