A Lochs-Type Approach via Entropy in Comparing the Efficiency of Different Continued Fraction Algorithms
A Lochs-Type Approach via Entropy in Comparing the Efficiency of Different Continued Fraction Algorithms
We investigate the efficiency of several types of continued fraction expansions of a number in the unit interval using a generalization of Lochs theorem from 1964. Thus, we aim to compare the efficiency by describing the rate at which the digits of one number-theoretic expansion determine those of another. We …