
129 - Transformers and Hierarchical Structure, with Shunyu Yao
NLP Highlights
Is There a Bounded Depth on the Stack?
In your paper, yu're also talking about obounded dept like languages. So youan explain what that is quickly? Yes. We know the especially is kind of talking about a stack, and the stack haf like a dap, nimit. And that kind of defines what a founded like stack languages are. Sopisically is trying to nimit, the maximum recursive depth of any stream to be at most three.
00:00
Transcript
Play full episode
Remember Everything You Learn from Podcasts
Save insights instantly, chat with episodes, and build lasting knowledge - all powered by AI.