3 citations · 5 across the 7 of their papers we have counts for
4 papers · 1 filter
Ball codes: A coding characterization of Hausdorff and packing dimensions
Kenshi Miyabe
We prove a purely classical, coding-theoretic characterization of Hausdorff and packing dimensions in \(\mathbb R^n\). A \emph{ball code} assigns names to closed balls of \(\mathbb…
Solovay reduction and continuity
Masahiro Kumabe, Kenshi Miyabe, Yuki Mizusawa +1
The objective of this study is a better understanding of the relationships between reduction and continuity. Solovay reduction is a variation of Turing reduction based on the dista…
Using almost-everywhere theorems from analysis to study randomness
Kenshi Miyabe, André Nies, Jing Zhang
We study algorithmic randomness notions via effective versions of almost-everywhere theorems from analysis and ergodic theory. The effectivization is in terms of objects described…
Van Lambalgen's Theorem for uniformly relative Schnorr and computable randomness
Kenshi Miyabe, Jason Rute
We correct Miyabe's proof of van Lambalgen's Theorem for truth-table Schnorr randomness (which we will call uniformly relative Schnorr randomness). An immediate corollary is one di…