Faculty Database - MIYABE Kenshi

Books and Papers

Conference Presentations

Academic Qualifications

Career History

Web Sites

Email Addresses

Current Specialized Field

（Last updated : 2022-09-01 15:11:44）

MIYABE Kenshi
Department Undergraduate School , School of Science and Technology

Position Associate Professor

■ Books and Papers

1.	2022	Article	Rational Sequences Converging to Left-c.e. Reals of Positive Effective Hausdorff Dimension Proceedings of the 9th International Conference on Computability Theory and Foundations of Mathemati pp.97-121 (Collaboration)
2.	2020/12	Article	Solovay reducibility and continuity Journal of Logic and Analysis 12(2),pp.1-22 (Collaboration)
3.	2019/06	Article	Uniform relativization Lecture Notes in Computer Science 11558,pp.50-61 (Single)
4.	2019/03	Article	Erdos-Feller-Kolmogorov-Petrowsky law of the iterated logarithm for self-normalized martingales: a game-theoretic approach Annals of Probability 47(2),pp.1136-1161 (Collaboration)
5.	2019/01	Article	Muchnik degrees and Medvedev degrees of the randomness notions Proceedings of ALC 2015 and ALC 2017 pp.108-128 (Single)
6.	2018/10	Article	Coherence of reducibilities with randomness notions Theory of Computing Systems 62(7),pp.1599-1619 (Single)
7.	2018/05	Article	Relation between the rate of convergence of strong law of large numbers and the rate of concentration of Bayesian prior in game-theoretic probability Stochastic Processes and their Applications 128(5),pp.1466-1484 (Collaboration)
8.	2018/03	Article	Randomness and Solovay degrees Journal of Logic and Analysis 10,pp.1-13 (Collaboration)
9.	2016/09	Article	Using Almost-Everywhere Theorems from Analysis to Study Randomness The Bulletin of Symbolic Logic 22(3),pp.305-331 (Collaboration)
10.	2016/04	Article	Reducibilities relating to Schnorr randomness Theory of Computing Systems 58(3),pp.441-462 (Single)
11.	2015/04	Article	Schnorr triviality and its equivalent notions Theory of Computing Systems 56(3),pp.465-486 (Single)
12.	2015/01	Article	Derandomization in Game-Theoretic Probability Stochastic Processes and their Applications 125,pp.39-59 (Collaboration)
13.	2014/08	Article	Uniform Kurtz randomness Journal of Logic and Computation 24(4),pp.863-882 (Collaboration)
14.	2014/05	Article	Algorithmic randomness over general spaces Mathematical Logic Quarterly 60(3),pp.184-204 (Single)
15.	2013/11	Article	An optimal superfarthingale and its convergence over a computable topological space Lecture Notes in Computer Science 7070,pp.273-284 (Single)
16.	2013/08	Article	The law of the iterated logarithm in game-theoretic probability with quadratic and stronger hedges Stochastic Processes and their Applications 123,pp.3132-3152 (Collaboration)
17.	2013/07	Article	Van Lambalgen's Theorem for uniformly relative Schnorr and computable randomness Proceedings of the Twelfth Asian Logic Conference pp.251-270 (Collaboration)
18.	2013/06	Article	L¹-computability, Layerwise Computability and Solovay Reducibility Computability 2,pp.15-29 (Single)
19.	2013/01	Article	Characterization of Kurtz Randomness by a Differentiation Theorem Theory of Computing Systems 52(1),pp.113-132 (Single)
20.	2012/02	Article	The difference between optimality and universality Logic Journal of the IGPL 20(1),pp.222-234 (Single)
21.	2012/01	Article	Convergence of random series and the rate of convergence of strong law of large numbers in game-theoretic probability Stochastic Processes and their Applications 122,pp.1-30 (Collaboration)
22.	2011/06	Article	Truth-table Schnorr randomness and truth-table reducibly randomness Mathematical Logic Quarterly 57(3),pp.323-338 (Single)
23.	2010/10	Article	An Extension of van Lambalgen's Theorem to Infinitely Many Relative 1-random Reals Notre Dame Journal of Formal Logic 51(3),pp.337-349 (Single)
Display 5 items
Display all(23)

■ Conference Presentations

1.	2022/06/09	Subclasses of weakly computable reals (International conference on computability, complexity and randomness 2022)
2.	2022/06/01	Generality of computable measures (Leeds Computability Days 2022)
3.	2020/09/15	The rate of convergence of computable predictions (German Mathematical Society)
4.	2019/08/08	Computable prediction (Artificial General Intelligence)
5.	2019/07/19	Uniform relativization (Computability in Europe)
6.	2019/07/19	Uniform relativization (Computability in Europe)
7.	2019/03/25	Schnorr triviality via decidable machines (Computability Theory and Foundations of Mathematics)
8.	2019/03/25	Schnorr triviality via decidable machines (Computability Theory and Foundations of Mathematics)
9.	2019/03/22	Muchnik degrees and Medvedev degrees of the randomness notions (American Mathematical Society)
10.	2019/03/22	Muchnik degrees and Medvedev degrees of the randomness notions (American Mathematical Society)
11.	2019/03/18	Coherence between reducibility and randomness notions (Mathematical Society of Japan)
12.	2019/03/18	Coherence between reducibility and randomness notions (Mathematical Society of Japan)
13.	2019/03/15	The chance that the sun will rise tomorrow revisited (SIG-AGI)
14.	2019/03/15	The chance that the sun will rise tomorrow revisited (SIG-AGI)
15.	2018/09/14	Erdos-Feller-Kolmogorov-Petrowsky law of the iterated logarithm (Workshop on Computability Theory and Foundations of Mathematics 2018)
16.	2018/09/13	A tutorial in game-theoretic probability and algorithmic randomness (Workshop on Computability Theory and Foundations of Mathematics 2018)
17.	2017/12/26	A hierarchy of functions corresponding randomness hierarchy (RIMS Symposia (open))
18.	2017/12/14	Computation at random points (IPA Math 2017)
19.	2017/10/07	Face randomness by mathematics (MATH POWER)
20.	2017/09/15	Solomonoff’s universal induction, or algorithmic probability (SIG-AGI)
21.	2017/03/25	Can one compute a more random set uniformly? (JMO)
22.	2017/02/24	Randomness notions in Muchnik and Medvedev degrees (Dagstuhl seminar on “Computability Theory”)
23.	2016/09/20	Randomness notions in Muchnik and Medvedev degrees (Computability Theory and Foundations of Mathematics 2016)
24.	2016/09/18	Computability of reals on the space where the triangle inequality does not hold (JMO)
25.	2016/06/17	Variants of layerwise computability (Thirteenth International Conference on Computability and Complexity in Analysis)
26.	2016/03/07	Mass problems for randomness notions (JMO)
27.	2015/09/16	Characterizations of 3-randomness via complexity (JMO)
28.	2015/09/11	Reducibilities as refinements of the randomness hierarchy (Computability Theory and Foundations of Mathematics 2015)
29.	2015/01/05	Total-machine reducibility and randomness notions (Asian Logic Conference 2015)
30.	2014/11/13	Derandomization in GameTheoretic Probability (Fifth Workshop on Game-Theoretic Probability and Related Topics)
31.	2014/06/13	Schnorr randomness versions of K, C, LR, vL-reducibilities (Conference on Computability, Complexity and Randomness CCR 2014)
32.	2014/03/15	Characterization of Lebesgue points via integral tests (JMO)
33.	2014/02/20	A Gap Phenomenon for Schnorr Randomness (Computability Theory and Foundations of Mathematics)
34.	2014/01/15	Unpredictability of initial points (RIMS研究集会「力学系と計算」)
35.	2013/12/02	Variants of Layerwise Computability (ARGENTINA-JAPAN-NEW ZEALAND WORKSHOP, UNIVERSITY OF AUCKLAND)
36.	2013/09/27	Almost uniform weak n-randomness (Eighth International Conference on Computability, Complexity and Randomness)
37.	2013/09/20	Being a Lebesgue point for integral tests (Asian Logic Conference 2013)
38.	2013/08/22	The emergence of probability from randomness and games (Modeling Market Dynamics and Equilibrium – New Challenges, New Horizons)
39.	2013/06/27	L^1-computability and the computability of conditional probability (Analysis, Randomness and Applications 2013)
40.	2013/05/15	The preordering related to uniform Schnorr randomness (ELC Workshop on Randomness and Probability Through Computability)
41.	2013/05/13	Uniform relativization and almost uniform relativization (ELC Seminar on Algorithmic Randomness)
42.	2013/03/21	Van Lambalgen’s Theorem for uniform Kurtz randomness (JMO)
43.	2013/03/20	The other history of probability theory (JMO)
44.	2013/03/18	Schnorr and Kurtz randomness versions of Merkle’s criterion (COMP)
45.	2013/02/22	Things to do in and with algorithmic randomness (Sendai Logic School 2013)
46.	2013/02/20	Computably measurable sets and computably measurable functions in terms of algorithmic randomness (Computability Theory and Foundations of Mathematics)
47.	2013/01/28	Computability of conditional probability (LA Symposium)
48.	2012/11/13	An introduction to algorithmic randomness (Fourth Workshop on Game-Theoretic Probability and Related Topics)
49.	2012/11/12	The law of the iterated logarithm in game-theoretic probability (Fourth Workshop on Game-Theoretic Probability and Related Topics)
50.	2012/09/21	Natural properties that a randomness notion should have (JMO)
51.	2012/09/16	An introduction to game-theoretic probability (SLACS 2012)
52.	2012/09/14	Schnorr triviality and a base for uniform Schnorr randomness (RIMS Symposia (open))
53.	2012/07/17	On the effectivization of Lusin’s theorem (LA Symposium)
54.	2012/07/06	Schnorr triviality is equivalent to being a basis for tt-Schnorr randomness (Seventh International Conference on Computability, Complexity and Randomness)
55.	2012/06/27	Weak L^1-computability and Limit L^1-computability (Ninth International Conference on Computability and Complexity in Analysis)
56.	2012/06/23	An integral test for Schnorr randomness and its applications (Computability in Europe 2012)
57.	2012/03/29	At which points are functions differentiable? (JMO)
58.	2012/03/29	The convergence rate of SLLN in the case of non-i.i.d. (JMO)
59.	2012/02/27	L^1-computability and weak L^1-computability (京都計算可能解析学シンポジウム2012)
60.	2012/02/23	Schnorr Layerwise Computability (証明論及び計算可能性理論に関するワークショップ)
61.	2011/12/20	Characterization of Kurtz randomness by a differentiation theorem (Twelfth Asian Logic Conference)
62.	2011/12/13	Randomness and separation axioms (ANALYSIS AND RANDOMNESS IN AUCKLAND)
63.	2011/12/02	An optimal superfarthingale and its convergence over a computable topological space (Solomonoff 85th Memorial Conference)
64.	2011/09/12	Randomness and differentiability (証明論と計算論研究集会)
65.	2011/08/23	An optimal semimeasure and its convergence (ALGi22)
66.	2011/06/29	Chara terizing randomness by integral tests (CiE 2011)
67.	2011/02/23	Degree of non-randomness and uniform Solovay reducibility (RIMS研究集会)
68.	2011/02/22	Towards prediction via randomness (Statistics for Stochastic Processes: Inference, Asymptotic Methods, Finance and Data Analysis)
69.	2011/01/31	Algorithmic randomness over general spaces (CCA-CCR 2011)
70.	2010/11/02	Frequency and belief are probability (SLACS 2010)
71.	2010/09/16	Algorithmic randomness over general spaces (数理解析研究所短期共同研究ー形式体系と計算理論ー)
72.	2010/09/06	Limit Theorems on a Computable Topological Space (ALGI21)
73.	2010/07/26	Computable Topology and Randomness (Computable Analysis in Kyoto)
74.	2010/03/01	An extension of van Lambalgen’s Theorem to infinitely many relative 1-random reals (GTP)
75.	2009/09/14	Another relativization of Schnorr randomness and computably randomness (ALGI20)
76.	2009/09/01	An extension of van Lambalgen’s Theorem to infinitely many relative 1-random reals (SLACS 2009)
77.	2007/03/12	Classification of Index Sets of Functions (CSCAT 2007)
Display 5 items
Display all(77)

■ Academic Qualifications

1.	2007/04～2010/03	〔Doctorial Course〕, Kyoto University, Completed, Doctor of science
2.	2005/04～2007/03	〔Master Course〕, Kyoto University, Completed, Master of science
3.	2001/04～2005/03	Department of Science, Kyoto University, Graduated,

■ Career History

1.	2017/10～	Meiji University School of Science and Technology Associate Professor
2.	2014/04～2017/09	Meiji University Department of Mathematics, School of Science and Technology Senior Assistant Professor
3.	2013/04～2014/03	JSPS Research Fellow at Tokyo University
4.	2011/04～2013/03	Kyoto University Global COE Research fellow
5.	2010/04～2011/03	Kyoto University Global COE Research fellow

■ Web Sites

http://kenshi.miyabe.name/wordpress/

■ Email Addresses

■ Current Specialized Field

Basic mathematics