HackerTube
HomeLongsLikedHistoryWatch laterCategoriesPlaylistsSettings

hoa

Talk×Play all on YouTube

Upload date

Past year2020s2010s2000s

Type

TalkLectureExplainerTutorialDocumentaryInterviewDemoCommentaryComedyMusic

Duration

Under 4 minutes4-20 minutes20-60 minutesOver 1 hour

Features

Hidden gemsEvergreen only

Sort by

RelevanceRecently recommendedUpload dateOldest firstView countLike ratioMost recommended
Let's #TalkConcurrency Panel Discussion with Sir Tony Hoare, Joe Armstrong, and Carl Hewitt1:06:45

Let's #TalkConcurrency Panel Discussion with Sir Tony Hoare, Joe Armstrong, and Carl Hewitt

13K views • 7 years ago
Erlang Solutions
A panel with Tony Hoare, Joe Armstrong and Carl Hewitt, hosted by Francesco Cesarini, on the history and future of concurrency. The three creators of CSP, Erlang and the actor model discuss their differing approaches.
Null References: The Billion Dollar Mistake - Tony Hoare1:01:59

Null References: The Billion Dollar Mistake - Tony Hoare

66K views • 7 years ago
JoseCan
Tony Hoare's InfoQ talk in which he describes introducing null references in ALGOL W in 1965 and calls it his billion-dollar mistake. He discusses language designer responsibility and run-time checks.
The Pervert's Guide to Computer Programming Languages - SXSW1:02:36

The Pervert's Guide to Computer Programming Languages - SXSW

28K views • 9 years ago
Vulk Coop
A SXSW talk by W Watson that uses Lacanian psychoanalysis, with nods to Zizek, to critique popular programming languages. It argues that people choose and defend languages for emotional and ideological reasons rather than rational ones.
Origins of Go Concurrency style by Rob Pike38:19

Origins of Go Concurrency style by Rob Pike

28K views • 14 years ago
jasonofthel33t
Rob Pike's 2010 talk at OSCON's Emerging Languages Camp on where Go's concurrency style comes from. It traces the idea from Hoare's CSP through Squeak, Newsqueak and Limbo to Go.
Three Beautiful Quicksorts53:56

Three Beautiful Quicksorts

45K views • 19 years ago
Google TechTalks
Jon Bentley walks through three implementations of Hoare's Quicksort, from a dozen-line C function to a series of systematic code transformations that make the program ever simpler and more powerful. It is a Google Tech Talk on code elegance and program derivation.