One-to-one mappings defined by finite transformers
The author introduces a class of finite algorithms (called \(R\)-transformers) which operate with infinite binary sequences of real numbers. It is shown that such algorithms can be used to construct a singular strictly increasing function and a bijection between the Euclidean plane and a real line. A number of properties of \(R\)-transformers and their inverse maps are discussed.
scientific article; zbMATH DE number 921654