Author of the publication

Using Almost-everywhere theorems from Analysis to Study Randomness.

, , and . Bull. Symb. Log., 22 (3): 305-331 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Miyabe, Kenshi
add a person with the name Miyabe, Kenshi
 

Other publications of authors with the same name

An Extension of van Lambalgen's Theorem to Infinitely Many Relative 1-Random Reals.. Notre Dame J. Formal Log., 51 (3): 337-349 (2010)Coherence of Reducibilities with Randomness Notions.. Theory Comput. Syst., 62 (7): 1599-1619 (2018)L1-Computability, Layerwise Computability and Solovay Reducibility.. Comput., 2 (1): 15-29 (2013)An Optimal Superfarthingale and Its Convergence over a Computable Topological Space.. Algorithmic Probability and Friends, volume 7070 of Lecture Notes in Computer Science, page 273-284. Springer, (2011)Schnorr Triviality and Its Equivalent Notions.. Theory Comput. Syst., 56 (3): 465-486 (2015)Reducibilities Relating to Schnorr Randomness.. Theory Comput. Syst., 58 (3): 441-462 (2016)Randomness and Solovay degrees., , and . J. Logic & Analysis, (2018)Algorithmic randomness over general spaces.. Math. Log. Q., 60 (3): 184-204 (2014)Solovay reducibility and continuity., , , and . J. Log. Anal., (2020)Unified characterizations of lowness properties via Kolmogorov complexity., and . Arch. Math. Log., 54 (3-4): 329-358 (2015)