activity
20192023
most citedA Simplicity Bubble Problem in Formal-Theoretic Learning Systems

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing cs.DCShow all

1 paper · 1 filter

cs.DC2019

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…