University of Hertfordshire Research Archive

        JavaScript is disabled for your browser. Some features of this site may not work without it.

        Browse

        All of UHRABy Issue DateAuthorsTitlesThis CollectionBy Issue DateAuthorsTitles

        Arkivum Files

        My Downloads
        View Item 
        • UHRA Home
        • University of Hertfordshire
        • Research publications
        • View Item
        • UHRA Home
        • University of Hertfordshire
        • Research publications
        • View Item

        The evolution and understanding of hierarchical complexity in biology from an algebraic perspective

        Author
        Nehaniv, C.L.
        Rhodes, J.L.
        Attention
        2299/3170
        Abstract
        We develop the rigorous notion of a model for understanding state transition systems by hierarchical coordinate systems. Using this we motivate an algebraic definition of the complexity of biological systems, comparing it to other candidates such as genome size and number of cell types. We show that our complexity measure is the unique maximal complexity measure satisfying a natural set of axioms. This reveals a strong relationship between hierarchical complexity in biological systems and the area of algebra known as global semigroup theory. We then study the rate at which hierarchical complexity can evolve in biological systems assuming evolution is “as slow as possible” from the perspective of computational power of organisms. Explicit bounds on the evolution of complexity are derived showing that, although the evolutionary changes in hierarchical complexity are bounded, in some circumstances complexity may more than double in certain “genius jumps” of evolution. In fact, examples show that our bounds are sharp. We sketch the structure where such complexity jumps are known to occur and note some similarities to previously identified mechanisms in biological evolutionary transitions. We also address the question of, How fast can complexity evolve over longer periods of time? Although complexity may more than double in a single generation, we prove that in a smooth sequence of t “inclusion” steps, complexity may grow at most from N to .N C 1/t C N, a linear function of number of generations t, while for sequences of “mapping” steps it increases by at most t. Thus, despite the fact that there are major transitions in which complexity jumps are possible, over longer periods of time, the growth of complexity may be broken into maximal intervals on which it is bounded above in the manner described.
        Publication date
        2000
        Published in
        Artificial life
        Published version
        https://doi.org/10.1162/106454600568311
        Other links
        http://hdl.handle.net/2299/3170
        Metadata
        Show full item record
        Keep in touch

        © 2019 University of Hertfordshire

        I want to...

        • Apply for a course
        • Download a Prospectus
        • Find a job at the University
        • Make a complaint
        • Contact the Press Office

        Go to...

        • Accommodation booking
        • Your student record
        • Bayfordbury
        • KASPAR
        • UH Arts

        The small print

        • Terms of use
        • Privacy and cookies
        • Criminal Finances Act 2017
        • Modern Slavery Act 2015
        • Sitemap

        Find/Contact us

        • T: +44 (0)1707 284000
        • E: ask@herts.ac.uk
        • Where to find us
        • Parking
        • hr
        • qaa
        • stonewall
        • AMBA
        • ECU Race Charter
        • disability confident
        • AthenaSwan