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