Interactive companion · visualization-first

Neural Computers as Learned Latent Runtimes

A visual map of the paper’s core claim: move from models that predict interfaces to models whose hidden state acts like the runtime itself. The page contrasts manifesto vs evidence, latent runtime vs external memory, and prototype strengths vs exactness failures.

arXiv 2604.06425
Authors: Zhuge et al. · 2026
Prototype systems: NCCLIGen + NCGUIWorld
Theme: latent state as compute + memory + I/O substrate
2
interface-conditioned prototypes
3
core claims unified: compute, memory, I/O
2014→2026
lineage from NTM / DNC to NC framing
1
known arXiv ID found in transcript

Machine Abstraction: where does “runtime” live?

Toggle between classical computing, memory-augmented neural systems, world models, and the paper’s proposed neural computer framing.

explicit modules latent / learned substrate interface I/O reliability stress point

State Collapse Index

A compact radar-like SVG compares how strongly each paradigm collapses program, memory, and interface into one learned state.

separation latent unification

Timeline of Nearby Ideas

From differentiable memory notebooks to world models to interface-conditioned rollouts. Hover nodes for details.

Comparative Matrix

Heatmap of qualitative properties. The paper’s novelty is strongest in framing, weaker in demonstrated exact execution.

Prototype Pipeline Viewer

Switch between terminal and desktop prototype flows. Step through training signal, conditioning, latent state, and predicted rollout.

Short-Horizon Coherence Heatmap

Mock evaluation grid showing where the prototypes look strongest: local visual continuity and action alignment, not durable symbolic semantics.

Manifesto → Prototype → Proof Gap

Bar chart of conceptual ambition versus what the transcript says the evidence actually supports.

Claim Surface

Bubble plot of claims by ambition and evidentiary strength. Upper-right is the danger zone: strong rhetoric, thin proof.

Where learned latent runtimes struggle

Interactive failure map of the mismatch between approximate learned dynamics and exact symbolic computation.

Error Accumulation Curves

Mock trajectories: local plausibility stays high for a while, but semantic fidelity decays faster as horizon increases.

References

Neural Computers — Zhuge et al. (2026)
Neural Turing Machines — Graves, Wayne, Danihelka (2014)
Hybrid Computing Using a Neural Network with Dynamic External Memory (2016)
World Models — Ha & Schmidhuber (2018)
Genie: Generative Interactive Environments (2024)
iVideoGPT: Interactive VideoGPTs Are Scalable World Models
CompilerDream: Learning a Compiler World Model for General Code Optimization
Transcript arXiv IDs found
2604.06425