Reproduce “Universal computation is intrinsic to language model decoding” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Alex Lewandowski, Marlos C. Machado, Dale Schuurmans

The authors prove that autoregressive decoding can simulate a universal computer by sliding a context window across a growing operational string and appending model outputs. They verify that Llama-4-17B-128E-Instruct executes all 1,857 rules of a universal Lag system. This result requires unbounded string growth and extended decoding; it does not establish universality for ordinary fixed-context prompting or practical execution.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.