| Publication | Date of Publication | Type |
|---|
| An effectivization of the law of large numbers for algorithmically random sequences and its absolute speed limit of convergence | 2022-12-27 | Paper |
Algorithmic information theory and its statistical mechanical interpretation
Sugaku Expositions | 2020-07-14 | Paper |
A statistical mechanical interpretation of algorithmic information theory
SpringerBriefs in Mathematical Physics | 2019-12-03 | Paper |
A statistical mechanical interpretation of algorithmic information theory
SpringerBriefs in Mathematical Physics | 2019-12-03 | Paper |
| An operational characterization of the notion of probability by algorithmic randomness II: Discrete probability spaces | 2019-08-29 | Paper |
| A refinement of quantum mechanics by algorithmic randomness | 2018-04-26 | Paper |
| An operational characterization of the notion of probability by algorithmic randomness and its applications | 2016-11-18 | Paper |
Phase transition and strong predictability
Unconventional Computation and Natural Computation | 2015-09-14 | Paper |
Cryptography and algorithmic randomness
Theory of Computing Systems | 2015-07-20 | Paper |
Spectral representation of some computably enumerable sets with an application to quantum provability
Unconventional Computation and Natural Computation | 2013-06-28 | Paper |
A Chaitin number based on compressible strings
Natural Computing | 2012-11-15 | Paper |
A statistical mechanical interpretation of algorithmic information theory. III: Composite systems and fixed points
MSCS. Mathematical Structures in Computer Science | 2012-10-23 | Paper |
Phase transition between unidirectionality and bidirectionality
Computation, Physics and Beyond | 2012-06-15 | Paper |
Fixed point theorems on partial randomness
Annals of Pure and Applied Logic | 2012-04-10 | Paper |
Chaitin \(\Omega \) numbers and halting problems
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
A new representation of Chaitin \(\Omega \) number based on compressible strings
Lecture Notes in Computer Science | 2010-07-26 | Paper |
| Properties of optimal prefix-free machines as instantaneous codes | 2010-07-24 | Paper |
Proposal of a signature scheme based on STS trapdoor
Post-Quantum Cryptography | 2010-06-17 | Paper |
Theory of one-tape linear-time Turing machines
Theoretical Computer Science | 2009-12-01 | Paper |
Partial Randomness and Dimension of Recursively Enumerable Reals
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
SOFSEM 2004: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2009-06-04 | Paper |
Fixed Point Theorems on Partial Randomness
Logical Foundations of Computer Science | 2009-02-24 | Paper |
Nonlinear Piece In Hand Perturbation Vector Method for Enhancing Security of Multivariate Public Key Cryptosystems
Post-Quantum Cryptography | 2008-11-11 | Paper |
An extension of Chaitin's halting probability Ω to a measurement operator in an infinite dimensional quantum system
MLQ | 2007-02-07 | Paper |
A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
Hokkaido Mathematical Journal | 2002-06-06 | Paper |
