One of the challenges of defining emergence is that one observer's prior knowledge may
cause a phenomenon to present itself as emergent that to another observer appears …

This article investigates emergence of algorithmic complexity in computable systems that
can share information on a network. To this end, we use a theoretical approach from …

In this paper, we study emergent irreducible information in populations of randomly
generated computable systems that are networked and follow a" Susceptible-Infected …

In this article, we will show that uncomputability is a relative property not only of oracle
Turing machines, but also of subrecursive classes. We will define the concept of a Turing …

This chapter presents a theoretical investigation of computation beyond the Turing barrier
from emergent behavior in distributed systems. In particular, we present an algorithmic …

As one of the main subjects of investigation in data science, network science has been
demonstrated a wide range of applications to real-world networks analysis and modeling …

Emergent algorithmic creativity on networked Turing machines Page 1 Eighth International
Workshop on Guided Self-Organization - Cancun, Mexico Felipe S. Abrahão E-mail …

We show in this article that uncomputability is also a relative property of subrecursive
classes built on a recursive relative incompressible function, which acts as a higher-order" …

Challenging the standard notion of totality in computable functions, one has that, given any
sufficiently expressive formal axiomatic system, there are total functions that, although …

In this article, we will show that uncomputability is a relative property not only of oracle
Turing machines, but also of subrecursive classes. We will define the concept of a Turing …