c programming

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.

Modern Vintage Gamer looks at OpenLara, an open source Tomb Raider engine, running on the Game Boy Advance. The video explains how the port achieves playable speeds on the GBA's slow ARM CPU, with input from the developer XProger.

SalC1 explains how the seed behind the Minecraft title screen panorama was found, using community effort and the Minecraft@Home project. It covers the search through Beta 1.7.3 world seeds.

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.

A short animated simulation comparing how Multics and Unix were developed, showing why Unix's small composable programs and pipes gave it a efficiency advantage. It frames Unix as a moonshot achievable by a small team.

CGP Grey compares airplane boarding methods, based on an arXiv paper, and shows why the intuitive back-to-front approach is slow while random or outside-in boarding does better.

The 8-Bit Guy covers IBM's 1981 CGA graphics system, including how composite output and artifacting produced extra colors beyond the nominal palette. He argues CGA looked better in period than it does on RGB monitors.

Martin Donald explains the Wave Function Collapse algorithm using Sudoku-like constraint solving and shows how he implemented it with Blender and Godot. It links demos and reference articles.

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.

The 8-Bit Guy explains the color limitations of 1980s computers and consoles such as the NES and Commodore 64. It shows how sprites, attributes and palettes shaped the look of old games.

An episode of Plogue's chipresearch series on emulating the Yamaha DX7 from the hardware up. It covers the sub CPU and main CPU, address map investigation, cartridges, firmware analysis and a skeleton MAME driver.

2swap explains how he solved the Klotski sliding-block puzzle by mapping its full state space as a graph and visualizing it. The video includes footage of the Guinness world-record solve and links to an interactive graph.

An episode of Coding Secrets by Jon Burton on retro copy protection, in particular physically damaging a disk with a laser so copies fail. It explains how this defeated hackers and pirates.

Numberphile with Daniel Erman on the Josephus problem, where people in a circle are eliminated in turn. It shows how the survivor's position follows a neat pattern tied to powers of two and binary.

LGR looks at the 1988 Canon Xap Shot, a still video camera that records photos to a floppy disk as analog NTSC signal rather than digital data.

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.

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.

Asianometry examines why Japan's software industry has lagged despite its hardware strengths. It looks at dependence on US software and the low prestige of programming.