Undecidability and Irreducibility Conditions for Open-Ended Evolution and Emergence | Citedby Results | Artificial Life | MIT Press

Skip to Main Content

Skip Nav Destination

Undecidability and Irreducibility Conditions for Open-Ended Evolution and Emergence

Artificial Life (2018) 24 (1): 56–70.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

Emergence and algorithmic information dynamics of systems and observers

Felipe S. Abrahão
Hector Zenil

Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (2022) 380 (2227)

Algorithmic networks: Central time to trigger expected emergent open-endedness

Felipe S. Abrahão
Klaus Wehmuth
Artur Ziviani

Theoretical Computer Science (2019) 785: 83.

Training-free measures based on algorithmic probability identify high nucleosome occupancy in DNA sequences

Hector Zenil
Peter Minary

Nucleic Acids Research (2019) 47 (20): e129.

Two-stage predictions of evolutionary dynamics during the rumor dissemination

Peng Lu
Qi Yao
Pengfei Lu

Physica A: Statistical Mechanics and its Applications (2019) 517: 349.

Zipf’s Law, unbounded complexity and open-ended evolution

Bernat Corominas-Murtra
Luís F. Seoane
Ricard Solé

Journal of The Royal Society Interface (2018) 15 (149): 20180395.

Algorithmically probable mutations reproduce aspects of evolution, such as convergence rate, genetic memory and modularity

Santiago Hernández-Orozco
Narsis A. Kiani
Hector Zenil

Royal Society Open Science (2018) 5 (8): 180399.

ALife and Society: Editorial Introduction to the Artificial Life Conference 2016 Special Issue

Jesús M. Siqueiros-García
Tom Froese
Carlos Gershenson
Wendy Aguilar
Hiroki Sayama
Eduardo Izquierdo

Artificial Life (2018) 24 (1): 1.