Prefer a chat interface with context about you and your work?
COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS
Abstract A coarse description of a set A ⊆ ω is a set D ⊆ ω such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse descriptions of a given set A …