16 Jop April 08

This document discusses Markov's string replacement algorithm and how it can be used to convert binary numbers to their unary equivalents through repeated string replacements. The algorithm works by applying a set of rules to shift the 1s in the binary number string to the right, effectively calculating the powers of two and representing the number in unary format. An example is shown converting the binary 11 to unary 111. The algorithm is described as simple but powerful, with applications in text generation and being Turing complete.