http://itmensf6tlh4ccibncmbeeidaaw7imhhsbovddstyujmfarks42bxiqd.onion/q/catalog.html
This viewpoint allows us to apply many techniques developed for use in thermodynamics to the subject of algorithmic information theory. In particular, suppose we fix a universal prefix-free Turing machine and let $X$ be the set of programs that halt for this machine. Then we can regard $X$ as a set of 'microstates', and treat any function on $X$ as an 'observable'.