HackerTube — KeepFlash Picks

KeepFlash Picks

Back to KeepFlash

Try

Search across video details, bilingual transcripts and articles.

1:03:51

History of computing01

Ken Thompson on Unix, Pipes and the Programs That Grew Around Them

Vintage Computer Federation2019

In conversation with Brian Kernighan, Ken Thompson traces his path to Bell Labs, the early Unix system on a PDP-7, and the practical proposal that brought a PDP-11. He recalls the arrival of pipes, the release of grep, the transition from B to C, and his work on computer chess.

53:21

Computability & complexity theory02

From Anonymous Functions to the Y Combinator

Confreaks2012

Starting with Turing machines and lambda calculus, Jim Weirich uses factorial to introduce higher-order functions, fixed points and functional refactoring, then derives a fixed-point combinator for Ruby's strict evaluation. The exercise reveals how recursion can emerge from anonymous functions.

Good ideas. Time well spent.

The collection

Ken Thompson on Unix, Pipes and the Programs That Grew Around Them

From Anonymous Functions to the Y Combinator