code readability

CGP Grey explains that postal codes are routing instructions for mail rather than geographic regions. He looks at the quirks and problems this causes.

Tom Scott explains for Computerphile how Unicode and UTF-8 grew out of messy older character encodings to become the web's standard. It covers why the design works and how it handles worldwide text.

Matthias Wandel tests old and new code on a range of PCs, including a new mini PC, to measure how much faster modern hardware really is. He also shows optimization techniques such as branchless code, with benchmark programs on GitHub.

CGP Grey explains why airport codes are inconsistent and sometimes confusing, from their origins in old weather station codes to the quirks that cause mistakes. He builds the story around a single typo that sent a flight to the wrong continent.

CodeParade's short devlog on how spherical geometry looks in 2D and 3D and why it feels so unusual, part of the Hyperbolica series on a non-Euclidean game.

Kaze Emanuar explains how he rewrote and optimized the Super Mario 64 source code so it runs far faster on real N64 hardware. He covers performance bottlenecks and fixes in detail for his ROM hacks.

Numberphile's Dr James Grime explains the flaw in the Enigma machine, namely that a letter could never be encrypted to itself, and how that helped the Allies break the code. It touches on the Bombe and Alan Turing.

A Two Minute Papers episode on NVIDIA's recurrent denoising autoencoder, which cleans up noisy Monte Carlo path-traced image sequences. It shows how a neural network can produce usable renders from very few samples.

About Here explains how North American building codes requiring two staircases make small multi-story apartment buildings hard to build, and contrasts this with places that allow single-stair designs.

A speedrunner-made explanation of the Super Mario World credits warp, an arbitrary code execution glitch that jumps the game straight to the ending. It simplifies the underlying assembly and memory behavior with animations so non-experts can follow.

Marcus du Sautoy of the BBC demonstrates the wisdom of the crowd, showing that averaging many guesses of jelly beans in a jar lands near the true count.

Tom Scott explains for Computerphile why handling time and timezones in code is so hard, walking through a simple web app that computes how long ago something happened. It covers the quirks of timezones and calendars and ends in an exasperated rant.

Ward Cunningham explains the history and intent of the debt metaphor, which he coined while refactoring the WyCash product. He says debt means code reflecting an incomplete understanding of the problem, not sloppy programming.

Climate Town gives a comedic, fast-paced account of how the plastics industry promoted recycling, including the resin-code recycling symbol, while knowing most plastic could not be economically recycled. It points viewers to the Frontline documentary Plastic Wars for a deeper treatment.

Polylog explains how algorithms can be turned into circuits and encoded as satisfiability problems, which lets you effectively run them backwards. It uses this to motivate breaking RSA, general reductions to SAT, and what P vs NP is really asking.

PBS Space Time episode on the black hole information paradox, covering how black holes seem to destroy information, the no-hair conjecture and the proposed role of the event horizon. It is part of a series on black holes.

3Blue1Brown's chapter 4 on deep learning gives a more formal, symbol-based account of backpropagation calculus, connecting the intuition from the previous chapter to the math found in textbooks and code.

Tom Scott explains YouTube's 11-character video IDs, which are base-64 encoded 64-bit numbers, and whether YouTube could ever run out of them. It covers counting systems and base 64 briefly.