← All IntelClip / OtherLoops as the Missing Piece for Turing Completeness
From Anthropic's CCA Exam as a Field-Guide for Agentic Engineering — Frank Coyle, UC Berkeley · ≈6:38
“Böhm and Jacopini, 1966 proved that if you want a language to be Turing complete, which means can compute anything that computers are possibly able to compute, then you need only three things.”
“If you add the loop, you have Turing computability.”
“This is where the agentic stuff is getting very exciting.”
What’s in it
- Explains why loops just made AI agents dramatically more powerful
- Traces agentic AI's loop obsession back to a 1966 math proof
- Breaks down the three ingredients needed for Turing completeness
Clip transcript
So, loops are the new big thing, right? Well, no, they're not. Okay? Um back in the day uh early days of computing, we had programming languages were exploding. We had Fortran, we had COBOL, and there were big fights. My program My programming language is better than yours. It can do more. No, it can't. We can do this. Böhm and Jacopini, 1966 proved that if you want a language to be Turing complete, which means can compute anything that computers are possibly able to compute, then you need only three things. The ability to to to write statements sequentially, okay? To have if-then conditionals, and the third piece is the loop. If you add the loop, you have Turing computability. And now we are seeing this being resurrected in the agentic world with the focus on loops, cuz up to now we've had sort of sequences. You have prompts, you have maybe if-then, but now we have a loop. And now this is what's giving us the power. This is where the agentic stuff is getting very exciting. Okay.
Comments
Sign in to comment.
Loading comments…