20 citations · 97 across the 14 of their papers we have counts for
Showing 2012 · cs.CCShow all
2 papers · 2 filters
cs.CC2012★ 1 cited
Short lists for shortest descriptions in short time
Jason Teutsch
Is it possible to find a shortest description for a binary string? The well-known answer is "no, Kolmogorov complexity is not computable." Faced with this barrier, one might instea…
cs.CC2012★ 17 cited
Translating the Cantor set by a random
Randall Dougherty, Jack Lutz, R. Daniel Mauldin +1
We determine the constructive dimension of points in random translates of the Cantor set. The Cantor set "cancels randomness" in the sense that some of its members, when added to M…