1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.LO2014★ 1 cited
Notions of robust information coding
Damir Dzhafarov, Gregory Igusa
We introduce and study several notions of computability-theoretic reducibility between subsets of that are "robust" in the sense that if only partial information is available a…
math.LO2012
Nonexistence of Minimal Pairs for Generic Computability
Gregory Igusa
A generic computation of a subset A of the natural numbers consists of a a computation that correctly computes most of the bits of A, and which never incorrectly computes any bits…