The Agent That Doesn't Know Itself
john (baez@math.ucr.edu)
The Agent That Doesn’t Know Itself
Posted by John Baez
guest post by William Waites
The previous post introduced the plumbing calculus: typed channels, structural morphisms, two forms of composition, and agents as stateful morphisms with a protocol for managing their state. The examples were simple. This post is about what happens when the algebra handles something genuinely complex.
To get there, we need to understand a little about how large language models work.
Large language models are...