Computational Complexity of Observing Evolution in Artificial-Life Forms
원문 초록
Observations are an essential component of the simulation based studies on artificial-evolutionary systems (AES) by which entities are identified and their behavior is observed to uncover higher-level "emergent" phenomena. Because of the heterogeneity of AES models and implicit nature of observations, precise characterization of the observation process, independent of the underlying micro-level reaction semantics of the model, is a difficult problem. Building upon the multiset based algebraic framework to characterize state-space trajectory of AES model simulations, we estimate bounds on computational resource requirements of the process of automatically discovering life-like evolutionary behavior in AES models during simulations. For illustration, we consider the case of Langton's Cellular Automata model and characterize the worst case computational complexity bounds for identifying entity and population level reproduction.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Automating the Search for Artificial Life with Foundation Models
CAX: Cellular Automata Accelerated in JAX
Emergent Collective Reproduction via Evolving Neuronal Flocks
JaxLife: An Open-Ended Agentic Simulator
How quantum and evolutionary algorithms can help each other: two examples
Computational Life: How Well-formed, Self-replicating Programs Emerge from Simple Interaction
토론
이 논문과 연결된 포럼 글이 아직 없습니다.