factual

Vector symbolic architectures are Turing complete

Vector symbolic architectures use two operations on high-dimensional vectors—superposition (summation creating interference) and binding (XOR for binary vectors, akin to attention's key-value pairs)—and with these two operations plus enough nested hierarchy you have a Turing complete system capable of representing any data structure, making distributed feature-based computation effectively a form of GOFAI.

factualpending

Speaker

Trenton Bricken

Evidence Quote

“With these two operations, you have aTuring complete system, with which you can, if you have enough nested hierarchy, represent any data structure you want.”

Source

Sholto Douglas & Trenton Bricken — How LLMs actually think— Dwarkesh Patel Podcast
Created: 6/13/2026, 3:31:11 AM

Your notes

Loading notes...