21min chapter

Future of Coding cover image

Beyond Efficiency by Dave Ackley

Future of Coding

CHAPTER

Exploring Errors and Robustness in Computing

The chapter delves into the concept of errors in computing, contrasting traditional computing with robust first computing and discussing the use of gradient descent for approximating solutions. It focuses on the robustness of sorting algorithms, specifically comparing bubble sort with merge sort and quick sort, while also touching on AI playing Tetris and handling challenges. Additionally, it explores performance optimization in code, highlighting the trade-offs between maximizing average performance and minimizing variability.

00:00

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