Researchers propose a recurrent language modeling approach using balanced-tree recursive operators that achieves logarithmic computational depth and linear runtime, offering an alternative to Transformers with fixed depth and quadratic complexity. Experiments show the model extrapolates well to longer sequences and approaches Transformer performance with ALiBi.