Finitary codes and the law of the iterated logarithm

Finitary Codes, a short survey

“…A systematic study of finitary coding had begun with the works of Keane and Smorodinsky ([10], [11], [12]), and Denker and Keane ([5], [6]). In their 1977 paper [10], and in subsequent articles [11], [12], Keane and Smorodinsky developed a theory and methodology of finitary coding, creating a new area of research, which has been (and is still being) extended in a multitude of ways.…”

Finitary Codes, a short survey

“…Definition 4. We say that dynamical systems are finitarily isomorphic with finite expected code times (fect) if both the finitary isomorphism φ and its inverse φ A systematic study of finitary coding had begun with the works of Keane and Smorodinsky ([10], [11], [12]), and Denker and Keane ([5], [6]). In their 1977 paper [10], and in subsequent articles [11], [12], Keane and Smorodinsky developed a theory and methodology of finitary coding, creating a new area of research, which has been (and is still being) extended in a multitude of ways.…”