The Minimal Complexity of Adapting Agents Increases with Fitness

被引:30
|
作者
Joshi, Nikhil J. [1 ,2 ]
Tononi, Giulio [3 ]
Koch, Christof [1 ,4 ]
机构
[1] CALTECH, Pasadena, CA 91125 USA
[2] Ecole Polytech Fed Lausanne, Blue Brain Project, Lausanne, Switzerland
[3] Univ Wisconsin, Dept Psychiat, Madison, WI 53706 USA
[4] Allen Inst Brain Sci, Seattle, WA USA
关键词
BIOLOGICAL COMPLEXITY; METABOLIC COST; EVOLUTION; INFORMATION; NECESSITY; CHANCE;
D O I
10.1371/journal.pcbi.1003111
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
What is the relationship between the complexity and the fitness of evolved organisms, whether natural or artificial? It has been asserted, primarily based on empirical data, that the complexity of plants and animals increases as their fitness within a particular environment increases via evolution by natural selection. We simulate the evolution of the brains of simple organisms living in a planar maze that they have to traverse as rapidly as possible. Their connectome evolves over 10,000s of generations. We evaluate their circuit complexity, using four information-theoretical measures, including one that emphasizes the extent to which any network is an irreducible entity. We find that their minimal complexity increases with their fitness.
引用
收藏
页数:10
相关论文
共 50 条
  • [21] Adapting particle swarm optimisation for fitness landscapes with neutrality
    Owen, Alan
    Harvey, Inman
    2007 IEEE SWARM INTELLIGENCE SYMPOSIUM, 2007, : 258 - +
  • [22] Feasibility of Wearable Fitness Trackers for Adapting Multimodal Communication
    Barber, Daniel
    Carter, Austin
    Harris, Jonathan
    Reinerman-Jones, Lauren
    HUMAN INTERFACE AND THE MANAGEMENT OF INFORMATION: INFORMATION, KNOWLEDGE AND INTERACTION DESIGN, HCI INTERNATIONAL 2017, PT I, 2017, 10273 : 504 - 516
  • [23] Algebras of minimal multiplicative complexity
    Blaeser, Markus
    Chokaev, Bekhan
    2012 IEEE 27TH ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC), 2012, : 224 - 234
  • [24] Abelian complexity of minimal subshifts
    Richomme, Gwenael
    Saari, Kalle
    Zamboni, Luca Q.
    JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 2011, 83 : 79 - 95
  • [25] The complexity of variable minimal formulas
    CHEN ZhenYu1
    2 Software Institute
    3 Department of Mathematics
    Science Bulletin, 2010, (18) : 1957 - 1960
  • [26] The complexity of variable minimal formulas
    CHEN ZhenYuXU BaoWen DING DeCheng National Key Laboratory for Novel Software TechnologyNanjing UniversityNanjing China Software InstituteNanjing UniversityNanjing China Department of MathematicsNanjing UniversityNanjing China
    Chinese Science Bulletin, 2010, 55 (18) : 1957 - 1960
  • [27] The minimal model of financial complexity
    Maymin, Philip Z.
    QUANTITATIVE FINANCE, 2011, 11 (09) : 1371 - 1378
  • [28] The complexity of variable minimal formulas
    Chen ZhenYu
    Xu BaoWen
    Ding DeCheng
    CHINESE SCIENCE BULLETIN, 2010, 55 (18): : 1957 - 1960
  • [29] The complexity of minimal satisfiability problems
    Kirousis, LM
    Kolaitis, PG
    INFORMATION AND COMPUTATION, 2003, 187 (01) : 20 - 39
  • [30] Analyzing Minimal Complexity Machines
    Abe, Shigeo
    2019 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2019,