cs.LG 2609.04661

Interpretability for Turing Machines

Using susceptibility techniques to analyze Turing machines' algorithmic structures, revealing symmetry and path separation features.

Billy Snikkers, Rumi Salazar, Daniel Murfet et al.

2026-09-04 33
cs.LG 2609.02881

Graph Machine: Towards Better Pretraining via Edges

Graph Machine (GM) maintains O(n) state with sparse, dynamic routing, replacing 75% of dense Transformer layers, achieving near state-of-the-art performance on 15.7B tokens.

Lintai Hou

2026-09-03 82