Info: Zenodo’s user support line is staffed on regular business days between Dec 23 and Jan 5. Response times may be slightly longer than normal.

There is a newer version of the record available.

Published August 30, 2017 | Version Submitted article
Working paper Open

Algorithmic Networks: Central Time to Trigger Expected Emergent Open-Endedness

  • 1. National Laboratory for Scientific Computing (LNCC)

Description

This article investigates emergence and complexity in complex systems that can share information on a network. To this end, we use a theoretical approach from information theory, computability theory, and complex networks. One key studied question is how much emergent complexity arises when a population of computable systems is networked compared with when this population is isolated. First, we define a general model for networked theoretical machines, which we call algorithmic networks. Then, we narrow our scope to investigate algorithmic networks that optimize the average fitnesses of nodes in a scenario in which each node imitates the fittest neighbor and the randomly generated population is networked by a time-varying graph. We show that there are graph-topological conditions that make these algorithmic networks have the property of expected emergent open-endedness for large enough populations. In other words, the expected emergent algorithmic complexity of a node tends to infinity as the population size tends to infinity. Given a dynamic network, we show that these conditions imply the existence of a central time to trigger expected emergent open-endedness. Moreover, we show that networks with small diameter compared to the network size meet these conditions. We also discuss future research based on how our results are related to some problems in network science, information theory, computability theory, distributed computing, game theory, evolutionary biology, and synergy in complex systems.

Notes

This article was submitted to an international peer-reviewed journal on October, 2017.

Files

3.1 - arXiv - 2017 - Felipe-Klaus-Artur.pdf

Files (829.5 kB)

Name Size Download all
md5:014820df94121cb3c044fe5deaa22f76
829.5 kB Preview Download

Additional details

Related works

Is identical to
arXiv:1708.09149 (arXiv)