Emergent Open-Endedness from Contagion of the Fittest

DOI10.25088/COMPLEXSYSTEMS.27.4.369zbMath1456.68013arXiv1806.07254OpenAlexW2963820414WikidataQ128013573 ScholiaQ128013573MaRDI QIDQ5126850

Klaus Wehmuth, Artur Ziviani, Felipe S. Abrahão

Publication date: 20 October 2020

Published in: Complex Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.07254

zbMATH Keywords

distributed systemscomplex networksemergencealgorithmic informationspreading

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Distributed systems (68M14)

Related Items (1)

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

This page was built for publication: Emergent Open-Endedness from Contagion of the Fittest