Software Engineering Daily cover image

Running Doom in TypeScript with Dimitri Mitropoulos

Software Engineering Daily

00:00

Turing-complete vs. practical computability

Dimitri critiques Turing-completeness claims and argues for 'Doom-complete' as a practical measure.

Play episode from 18:30
Transcript

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