10 citations · 23 across the 4 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
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…
cs.IT2008★ 4 cited
A statistical mechanical interpretation of algorithmic information theory
Kohtaro Tadaki
We develop a statistical mechanical interpretation of algorithmic information theory by introducing the notion of thermodynamic quantities, such as free energy, energy, statistical…