NLP Highlights cover image

129 - Transformers and Hierarchical Structure, with Shunyu Yao

NLP Highlights

00:00

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.

Transcript
Play full episode

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app