10 citations · 19 across the 3 of their papers we have counts for
3 papers
cs.IT2008★ 2 cited
Equivalent characterizations of partial randomness for a recursively enumerable real
Kohtaro Tadaki
A real number αis called recursively enumerable if there exists a computable, increasing sequence of rational numbers which converges to α. The randomness of a recursively enumerab…
quant-ph2004★ 10 cited
An extension of Chaitin's halting probability Ωto a measurement operator in an infinite dimensional quantum system
Kohtaro Tadaki
This paper proposes an extension of Chaitin's halting probability Ωto a measurement operator in an infinite dimensional quantum system. Chaitin's Ωis defined as the probability tha…
quant-ph2002★ 7 cited
Upper bound by Kolmogorov complexity for the probability in computable POVM measurement
Kohtaro Tadaki
We apply algorithmic information theory to quantum mechanics in order to shed light on an algorithmic structure which inheres in quantum mechanics. There are two equivalent ways to…