A Statistical Mechanical Interpretation of Algorithmic Information TheoryThe Partial Randomness of Recursively Enumerable Reals
A Statistical Mechanical Interpretation of Algorithmic Information Theory: The Partial Randomness...
Tadaki, Kohtaro
2019-11-12 00:00:00
[In this chapter, we investigate the partial randomness of a recursively enumerable real, also known as a left-computable real, and gives a theorem which plays an important role in the analysis of the thermodynamic quantities of AIT.]
http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.pnghttp://www.deepdyve.com/lp/springer-journals/a-statistical-mechanical-interpretation-of-algorithmic-information-NgVXizUgVl
A Statistical Mechanical Interpretation of Algorithmic Information TheoryThe Partial Randomness of Recursively Enumerable Reals
[In this chapter, we investigate the partial randomness of a recursively enumerable real, also known as a left-computable real, and gives a theorem which plays an important role in the analysis of the thermodynamic quantities of AIT.]
Published: Nov 12, 2019
Recommended Articles
Loading...
There are no references for this article.
Share the Full Text of this Article with up to 5 Colleagues for FREE
Sign up for your 14-Day Free Trial Now!
Read and print from thousands of top scholarly journals.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.