Remark. Looped Transformers as a source result [ftip-00KI]
Remark. Looped Transformers as a source result [ftip-00KI]
Giannou et al. show that a fixed shallow Transformer placed in a loop can execute programmed iterative computations, including conditional branches and in-context algorithms, in Looped Transformers as Programmable Computers[giannou2023looped]. This is a source result under its program, state, and precision assumptions; it is not a universal claim about language-model capability.