Computability of the ergodic decomposition |
| |
Authors: | Mathieu Hoyrup |
| |
Institution: | LORIA, INRIA Nancy-Grand Est, 615 rue du jardin botanique, 54600 Villers-lès-Nancy, France |
| |
Abstract: | The study of ergodic theorems from the viewpoint of computable analysis is a rich field of investigation. Interactions between algorithmic randomness, computability theory and ergodic theory have recently been examined by several authors. It has been observed that ergodic measures have better computability properties than non-ergodic ones. In a previous paper we studied the extent to which non-ergodic measures inherit the computability properties of ergodic ones, and introduced the notion of an effectively decomposable measure. We asked the following question: if the ergodic decomposition of a stationary measure is finite, is this decomposition effective? In this paper we answer the question in the negative. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|