AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
2min chapter
Fold and Scan
The Array Cast
The Problem With the Fixed Point Algorithm in K and Q
There are no primitives that can keep going forever in BQ. There's nothing that takes a variable amount of time depending on what argument it gets. So, be careful it has repeat, but it's only ever a fixed number of times. What an awesome rabbit hole. I feel like I've dropped through something. Sounds like so that there was, there was like fixed point scans in there, which I think they've been referred to. Does that make K and Q the only languages that have those two?
00:00
Transcript
Episode notes
Get the Snipd
podcast app
Unlock the knowledge in podcasts with the podcast player of the future.
AI-powered
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