Kenshi Miyabe

Orcid: 0000-0002-5346-4269

According to our database1, Kenshi Miyabe authored at least 18 papers between 2010 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Solovay reducibility and continuity.
J. Log. Anal., 2020

2019
Uniform Relativization.
Proceedings of the Computing with Foresight and Industry, 2019

Computable Prediction.
Proceedings of the Artificial General Intelligence - 12th International Conference, 2019

2018
Coherence of Reducibilities with Randomness Notions.
Theory Comput. Syst., 2018

Randomness and Solovay degrees.
J. Log. Anal., 2018

2016
Reducibilities Relating to Schnorr Randomness.
Theory Comput. Syst., 2016

Using Almost-everywhere theorems from Analysis to Study Randomness.
Bull. Symb. Log., 2016

2015
Schnorr Triviality and Its Equivalent Notions.
Theory Comput. Syst., 2015

Unified characterizations of lowness properties via Kolmogorov complexity.
Arch. Math. Log., 2015

2014
Algorithmic Randomness and Complexity (NII Shonan Meeting 2014-10).
NII Shonan Meet. Rep., 2014

Algorithmic randomness over general spaces.
Math. Log. Q., 2014

Uniform Kurtz randomness.
J. Log. Comput., 2014

2013
Characterization of Kurtz Randomness by a Differentiation Theorem.
Theory Comput. Syst., 2013

L<sup>1</sup>-Computability, Layerwise Computability and Solovay Reducibility.
Comput., 2013

2012
The difference between optimality and universality.
Log. J. IGPL, 2012

2011
Truth-table Schnorr randomness and truth-table reducible randomness.
Math. Log. Q., 2011

An Optimal Superfarthingale and Its Convergence over a Computable Topological Space.
Proceedings of the Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence, 2011

2010
An Extension of van Lambalgen's Theorem to Infinitely Many Relative 1-Random Reals.
Notre Dame J. Formal Log., 2010


  Loading...