In this talk you gave at the Alan Turing Institute you kind of expounded on how RNNs relate to the models of computation we're familiar with. You made the argument that in the hierarchy they lie closer to finite state machines I don't necessarily have access to unbounded memory than to Turing machines. How do you think about the introduction of transformers in terms of that computational hierarchy question? That's an interesting question to ask specifically because I had one of my student Minchi Jiang sent me a paper just the other day on this topic is called Looped Transformers as Programmable Computers by Angelique Genu and colleagues.

Get the Snipd
podcast app

Unlock the knowledge in podcasts with the podcast player of the future.
App store bannerPlay store banner

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode

Save any
moment

Hear something you like? Tap your headphones to save it with AI-generated key takeaways

Share
& Export

Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode