Skip to content
Algorithmic randomness , Invited Lecture, 2026 Annual Meeting of the Mathematical Society of Japan,(24 Mar, 2026), Tokyo
Why are Calculus, Linear Algebra, and Probability and Statistics Important?, Lecture at Meiji High School, (26 Nov, 2025), Tokyo
Can Artificial Intelligence Become a University Professor?, Lecture at Nihon Gakuen High School, (19 Nov, 2025), Tokyo
Randomness with respect to c.e. semimeasures , CCA2025, (24 Sep, 2025), Kyoto
Variation of weakly computable reals in Solovay reducibility , ALC, (8 Sep, 2025), Kyoto
Solovay reducibility for computably approximable reals , Workshop@BIMSA, (28 Aug, 2025), Beijing
Can AI be a mathematician? , Summer seminar for affiliated schools, (25 Aug, 2025), Kawasaki
Solovay reducibility for computably approximable reals , CCR, (17 June 2025), Bordeaux (France), invited
Quantifier Variations in Solovay Reducibility , AMS, (4 May 2025), San Luis Obispo
How to study mathematics in the era of generative AI , Collaborative Event, (25 Mar, 2025), Kawasaki
Quantifier variations in Solovay reducibility , MSJ, (18 Mar, 2025), Tokyo
Algorithmic Information Theory , Statistics Seminar, (11 Mar, 2025), Sapporo
Rate of convergence of computable prediction , LA Symposium, (28 Jan, 2025), Kyoto
What is AI doing? , Kofu Minami High School, (11 Oct, 2024), Kofu
Algorithmic randomness theory and learnability , SAML2024, (9-11 July, 2024), Kyoto
Strong Solovay reducibility , CCR2024, (12 Mar, 2024), Nagoya
Strong Solovay reducibility , Proof theory workshop@RIMS, (12 Dec, 2023), Kyoto
Computable prediction , Mini-workshop on computability in Tokyo, (6 Nov, 2023), Tokyo
Solovay reducibility and signed-digit representation , CCC@RIMS, (26 Sep, 2023), Kyoto
Characterizations of Solovay reducibility via query restriction for signed-digit representation , Mathsoc, (22 Sep, 2023), Sendai
Computability of reals , Summer School, (12-15 Sep, 2023), Tokyo
Solovay reducibility and signed-digit representation , NUS workshop, (15 June, 2023), Singapore
Subclasses of the weakly computable reals , Tokyo model theory seminar, (26 Oct, 2022), Online
Subclasses of weakly computable reals that form real closed , Mathsoc, (15 Sep, 2022), Sapporo
Subclasses of weakly computable reals , CCR2022, (9 June, 2022), INI(UK) & Online
Generality of computable measures , LCD2022, (1 June, 2022), Leeds & Online
The rate of convergence of computable predictions, The Mathematical Society of Japan, (28 Mar, 2022), Saitama University => cancelled
The rate of convergence of computable predictions , RIMS workshop, (22 Dec, 2021),RIMS&Zoom
The rate of convergence of computable predictions , DMV, (15 Sep, 2020), Online
Reverse randomness , talk at Kyoto Univ., (8 Nov, 2019), Kyoto
Computable prediction , AGI2019, (Aug, 2019), Shenzhen (China)
Uniform relativization , CiE2019, (19 July, 2019), Durham (UK) invited to a special session
Schnorr triviality via decidable machines , CTFM2019, (25 Mar, 2019), Wuhan (China) invited
Muchnik degrees and Medvedev degrees of the randomness notions , AMS, (22 Mar, 2019), Hawaii
Coherence between reducibility and randomness notions , MathSocJP, (18 Mar, 2019), Tokyo
The chance that the sun will rise tomorrow revisited , SIG-AGI, (15 Mar, 2019), Tokyo
Construction of random and nonrandom sets , talk in SLS2018, (8 Dec, 2018), Sendai
Erdos-Feller-Kolmogorov-Petrowsky law of the iterated logarithm , talk in CTFM2018, (14 Sep, 2018), Tokyo
A tutorial in game-theoretic probability and algorithmic randomness , talk in CTFM2018, (13 Sep, 2018), Tokyo
The law of the iterated logarithm , seminar talk in the lab, (30 July, 2018), Kawasaki
Continuity of limit computable functions , a seminar talk in University of Hawaii
at Manoa, (1 Mar, 2018), Honolulu
Continuity of limit computable functions at 1-generic points , seminar with Suzuki lab, (14 Feb, 2018), Kawasaki
A hierarchy of functions corresponding randomness hierarchy , RIMS workshop, (26 Dec, 2017), Kyoto
Computation at random points , IPA math 2017, (14 Dec, 2017), Nakano
What is mathematics at all? , Meiji High School, (6 Dec, 2017), Chofu
Halting Probability $\Omega$ , Young gathering on mathematical foundations, (20 Oct, 2017), Hachioji
Face randomness by mathematics , mathpower, (7 Oct 2017), Tokyo (invited)
Solomonoff’s universal induction, or algorithmic probability , SIG-AGI, (15 Sep 2017), Tokyo (invited)
Turing degree , Summer school of mathematical foundations 2017,(6 Aug 2017),Tokyo
Berry’s paradox , Freshman seminar (22 Apr 2017), Kawasaki
Random numbers , A talk at a high school (20 Apr 2017), Yokohama
Can one compute a more random set uniformly? , MSJ (25 Mar 2017), Hachioji
An Introduction to statistics , A talk to junior-high students (24 Mar 2017), Kawasaki
Randomness of randomness deficiency , Joint seminar with Suzuki lab (3 Mar 2017), Hachioji
Randomness notions in Muchnik and Medvedev degrees , Dagstuhl seminar on “Computability Theory” (24 Feb 2017), Warden (Germany)
A way to judge using probability , lecture in a high school (13 Dec 2016), Kanagawa
Randomness notions in Muchnik and Medvedev degrees , CTFM (20 Sep 2016), Tokyo
Computability of reals on the space where the triangle inequality does not hold , Mathematical Society of Japan at Kansai University (18 Sep 2016), Suita-city
Computability of reals on the space where the triangle inequality does not hold , Lab seminar (28 July 2016), Kawasaki
Variants of layerwise computability , CCA2016 (15-17 June 2016), Faro (Portugal), (invited)
Randomness and computability , Colloquium at Tsukuba University (2 June 2016) Tsukuba
Mass problems for randomness notions , The mathematical Society of Japan in University of Tsukuba (17 Mar 2016) Tsukuba
On the notions of randomness and probability , The Third Meeting of Quantum Foundation Club (12 Mar 2016) Tokyo
Mass problems for randomness notions , a seminar in Ikuta (18 Feb 2016) Kawasaki-shi
What is random? , Ikuta Salon (12 Dec 2015) Kawasaki-shi
Separation of randomness notions in Weihrauch degrees , Dagstuhl Seminar 15392 (25 Sep 2015), Warden (Germany)
Characterizations of 3-randomness via complexity , MSJ Autumn Meeting 2015 (16 Sep 2015), Kyoto
Reducibilities as refinements of the randomness hierarchy , CTFM2015 (11 Sep 2015), Tokyo
Welcome to mathematical paradoxes , Summer seminar for high school students (17 Aug 2015), Kawasaki
The randomness hierarchy and reducibilities as its refinements , Joint seminar with TMU (23 Feb 2015), Hachioji
Total-machine reducibility and randomness notions , ALC2015 (5 Jan 2015), Mumbai (India), (invited)
Derandomization in game-theoretic probability , GTP2014 (13 Nov 2014), Guanajuato (Mexico)
A game-theoretic proof of Erdos-Feller-Kolmogorov-Petrowsky law of the iterated logarithm for fair-coin tossing (presented by Prof. Takemura), The mathematical Society of Japan (26 Sep 2014), Hiroshima
Betting game and mathematics , Summer seminar for high school students (17 Aug 2014), Kawasaki
Mathematical formulation of “unpredictability , Katarou seminar (21 June 2014), Kyoto
Schnorr randomness versions of K, C, LR, vL-reducibilities , CCR2014 (13 June 2014), Singapore
Characterization of Lebesgue points via integral tests , Mathematical Society of Japan (16 Mar 2014), Tokyo
A Gap Phenomenon for Schnorr Randomness , CTFM (20 Feb 2014), Tokyo
Unpredictability of initial points , RIMS Workshop: Dynamical Systems and Computation, (15 Jan 2014), Kyoto (invited)
Variants of Layerwise Computability , ARGENTINA-JAPAN-NEW ZEALAND WORKSHOP, (2-3 Dec 2013), Auckland in New Zealand (invited)
Almost uniform weak n-randomness , CCR2013, (23-27 Sep 2013), Moscow in Russia
Being a Lebesgue point for integral tests , ALC 2013, (16-20 Sep 2013), Guangzhou in China
$L^1$-computability and Schnorr randomness , A seminar talk at Universität der Bundeswehr München (26 Aug 2013), München in Germany
The emergence of probability from randomness and games (with A. Takemura), Modeling Market Dynamics and Equilibrium: New Challenges, New Horizons, (19-22 Aug 2013), Bonn in Germany (invited)
Polynomial-time randomness and differentiability (presented by Kawamura ), CiE2013, (1-5 July 2013), Milano in Italy
Lowness for uniform Kurtz randomness (presented by Kihara ), CiE2013, (1-5 July 2013), Milano in Italy
$L^1$-computability and the computability of conditional probability , ARA, (27-28 June 2013), Nancy in France (invited)
From randomness to prediction and probability , Group seminar, (12 June 2013), Tokyo
The preordering related to uniform Schnorr randomness , RPTC2013, (15 May 2013), Tokyo
Uniform relativization and almost uniform relativization , ELC Seminar on Algorithmic Randomness, (13 May 2013), Tokyo
The way to capture the notion of probability , Seminar of Hasuo group, (23 April 2013), Tokyo
Van Lambalgen’s Theorem for uniform Kurtz randomness , The Mathematical Society of Japan, (21 March 2013), Kyoto
The other history of probability theory , The Mathematical Society of Japan, (20 March 2013), Kyoto
Schnorr and Kurtz randomness versions of Merkle’s criterion , COMP, (18 March 2013), Gifu
Things to do in and with algorithmic randomness , SLS2013, (22-23 Feb 2013), Sendai
Computably measurable sets and computably measurable functions in terms of algorithmic randomness , CTFM, (18-20 Feb 2013), Tokyo
Computability of conditional probability , LA symposium 2012, (28 Jan 2013), Kyoto
Van Lambalgen’s Theorem for uniform Kurtz randomness , Seminar Talk in Tokyo Institute of Technology, (25 Jan 2013), Tokyo
Computable measures in computable analysis , Seminar Talk in JAIST, (20 Dec 2012), Ishikawa
Van Lambalgen’s Theorem and Radon-Nikodym derivative , Young Logician’s Gathering in Japan, (23 – 25 Nov 2012), Nara
An introduction to algorithmic randomness , Fourth Workshop on Game-Theoretic Probability and Related Topics, (12 – 14 Nov 2012), The University of Tokyo
The law of the iterated logarithm in game-theoretic probability , Fourth Workshop on Game-Theoretic Probability and Related Topics, (12 – 14 Nov 2012), The University of Tokyo
Where is randomness? , Math Lectures, (13 Oct 2012), Kyoto University
Natural properties that a randomness notion should have , The Mathematical Society of Japan, (18-21 Sep 2012), Kyushu University
An introduction to game-theoretic probability , SLACS 2012, (15-16 Sep 2012), Kyoto Sangyo University
Schnorr triviality and being a basis for tt-Schnorr randomness , Proof theory and complexity, (12-14 Sep 2012), RIMS
On the notion of randomness , Summer school of foundations of mathematics, (4-7 Sep 2012), Tokyo Institute of Technology
On the effectivization of Lusin’s theorem , LA symposium 2012, (17 July, 2012), Kyoto
Schnorr triviality is equivalent to being a basis for tt-Schnorr randomness , CCR 2012, (2 – 6 July, 2012), Isaac Newton Institute
Weak L^1-computability and Limit L^1-computability , CCA 2012, (24 – 27 June, 2012), University of Cambridge
An integral test for Schnorr randomness and its applications , CiE 2012, (18 – 23 June, 2012), University of Cambridge
Schnorr triviality is equivalent to being a basis for tt-Schnorr randomness , CS seminar, (7 June, 2012), Kyoto University
Algorithmic interpretation of probability , CAPE lectures, (29 May 2012), Kyoto University
The limit of prediction and randomness , CS seminar, (26 Apr 2012), Kyoto University
The convergence rate of SLLN in the case of non-i.i.d. (with A. Takemura), Annual meeting of Mathematical Society of Japan 2012, (26-29 Mar 2012), Tokyo University of Science
At which points are functions differentiable? , Annual meeting of Mathematical Society of Japan 2012, (26-29 Mar 2012), Tokyo University of Science
Why the event with probability 0 happen , Young-RICE, (20 Mar 2012), Kyoto University
L^1-computability and weak L^1-computability , Kyoto computable analysis Symposium 2012, (24-27 Feb 2012), Kyoto Sangyo University
Schnorr Layerwise Computability , Workshop on Proof Theory and Computability Theory 2012, (20-23 Feb 2012), Harumi Grand Hotel
An introduction to algorithmic randomness , GCOE tea time, (10 Jan 2012), Kyoto University
Characterization of Kurtz randomness by a differentiation theorem , Twelfth Asian Logic Conference, (15 – 20 Dec 2011), Wellington, New Zealand (invited)
Randomness and separation axioms , Analysis and Randomness in Auckland, (13 – 14 Dec 2011), Auckland (invited)
An optimal superfarthingale and its convergence over a computable topological space, Solomonoff 85th Memorial Conference , (30 Nov – 2 Dec 2011), Melbourne (referred)
Characterization of Kurtz randomness by a differentiation theorem , CS Seminar, (17 Nov 2011), Kyoto University
Randomness and differentiability , WORKSHOP ON PROOF THEORY AND THEORY OF COMPUTING 2011, (Sep 12, 2011), Tokyo Metropolitan University
An optimal semimeasure and its convergence , ALGI 22, (Aug 23, 2011), University of Tokyo
Characterizing randomness by integral tests , CiE 2011, (June 29, 2011), Sofia University (abstract referred)
Characterizing randomness by integral tests , CS Seminar, (June 16, 2011), Kyoto University
Computability of measures and A-topology , CC-Seminar, (Mar 4, 2011), Kyoto Sangyo University
Degree of non-randomness and uniform Solovay reducibility , WORKSHOP ON PROOF THEORY AND COMPUTABILITY THEORY, (Feb 23, 2011), Iwanumaya in Sendai (invited)
Towards prediction via randomness , SSP, (Feb 22, 2011), University of Tokyo in Tokyo
Randomness in a dynamical system , DSC seminar, (Feb 14, 2011), Hokkaido University in Hokkaido
Algorithmic randomness over general spaces , CCA-CCR 2011, (Jan 31, 2011), Cape town in South Africa (abstract referred)
Frequency and belief are probability , SLACS2010, (Nov 2, 2010), Sendai in Japan
How much better can we predict the future? , Kumamoto(October 2, 2010), Kyoto(October 22, 2010), Gifu(October 25, 2010) in Japan
Algorithmic randomness over general spaces , “Formal Systems and Computability Theory” as a RIMS research project, (Sep 16, 2010), Kyoto in Japan
Limit theorems on a computable topological space , ALGI21, (Sep 6, 2010), Shiga in Japan
Computable Topology and Randomness , Computable Analysis in Kyoto, (Jul 26, 2010), Kyoto in Japan
Algorithmic randomness , RIMS colloquium, (Jun 16, 2010), Kyoto in Japan
Algorithmic randomness over general spaces , RIMS CS seminar, (Jun 10, 2010), Kyoto in Japan
An extension of van Lambalgen’s Theorem to infinitely many relative 1-random reals , a workshop, (Mar 1, 2010), Tokyo in Japan.
An extension of van Lambalgen’s Theorem to infinitely many relative 1-random reals , my D.Sc. Defence, (Jan 19, 2010), Kyoto in Japan.
Another relativization of Schnorr randomness and computably randomness , ALGI20, (Sep 14, 2009), Tottori in Japan.
An extension of van Lambalgen’s Theorem to infinitely many relative 1-random reals , SLACS 2009, (Sep 1, 2009), Kyoto in Japan.
Classification of Index Sets of Functions , CSCAT 2007, (Mar 12, 2007), Kyoto in Japan.