7 papers
An Algorithmic Information Distortion in Multidimensional Networks
Felipe S. Abrahão, Klaus Wehmuth, Hector Zenil +1
Network complexity, network information content analysis, and lossless compressibility of graph representations have been played an important role in network analysis and network m…
Emergence of complex data from simple local rules in a network game
Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
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. For e…
On the existence of hidden machines in computational time hierarchies
Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
Challenging the standard notion of totality in computable functions, one has that, given any sufficiently expressive formal axiomatic system, there are total functions that, althou…
Transtemporal edges and crosslayer edges in incompressible high-order networks
Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
This work presents some outcomes of a theoretical investigation of incompressible high-order networks defined by a generalized graph representation. We study some of their network…
Learning the undecidable from networked systems
Felipe S. Abrahão, Ítala M. Loffredo D'Ottaviano, Klaus Wehmuth +2
This article presents a theoretical investigation of computation beyond the Turing barrier from emergent behavior in distributed systems. In particular, we present an algorithmic n…
Expected Emergence of Algorithmic Information from a Lower Bound for Stationary Prevalence
Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani
We study emergent information in populations of randomly generated networked computable systems that follow a Susceptible-Infected-Susceptible contagion (or infection) model of imi…