2 citations · 2 across the 9 of their papers we have counts for
5 papers · 1 filter
Paths, Ends and The Separation Problem for Infinite Graphs
Nicanor Carrasco-Vargas, Valentino Delle Rose, Cristóbal Rojas
We introduce and study the Separation Problem for infinite graphs, which involves determining whether a connected graph splits into at least two infinite connected components after…
Classifying word problems of finitely generated algebras via computable reducibility
Valentino Delle Rose, Luca San Mauro, Andrea Sorbi
We contribute to a recent research program which aims at revisiting the study of the complexity of word problems, a major area of research in combinatorial algebra, through the len…
Probabilistic vs deterministic gamblers
Laurent Bienvenu, Valentino Delle Rose, Tomasz Steifer
Can a probabilistic gambler get arbitrarily rich when all deterministic gamblers fail? We study this problem in the context of algorithmic randomness, introducing a new notion -- a…
Relativized depth
Laurent Bienvenu, Valentino Delle Rose, Wolfgang Merkle
Bennett's notion of depth is usually considered to describe the usefulness and internal organization of the information encoded into an object such as an infinite binary sequence.…
Word problems and ceers
Valentino Delle Rose, Luca San Mauro, Andrea Sorbi
This note addresses the issue as to which ceers can be realized by word problems of computably enumerable (or, simply, c.e.) structures (such as c.e. semigroups, groups, and rings)…