16 citations · 52 across the 14 of their papers we have counts for
4 papers · 1 filter
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…
The "paradox" of computability and a recursive relative version of the Busy Beaver function
Felipe S. Abrahão
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 Turi…
Relativizing an incompressible number and an incompressible function through subrecursive extensions of Turing machines
Felipe S. Abrahão
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…