CoRecursive: Coding Stories cover image

Tech Talk: Total Swift Programming

CoRecursive: Coding Stories

00:00

Can You Tell if a Programmer Is a Tering Machine?

Is it possible to write another programme that can decide if any programm terminates or not? The profece is surprisingly simple, but a bit a contrive if not used to proofs by contradiction. We know there exist some structures that always terminate. If you have a function like map on lists, you can pretty easily prove that it always terminates. But this doesn't tell you that they're not there. It's what we're betting on with languages like iterson rigda.

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