HackerTube
HomeLongsLikedHistoryWatch laterCategoriesPlaylistsSettings

solver

Over 1 hour×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
Dennis Gustafsson – Parallelizing the physics solver – BSC 20251:07:09

Dennis Gustafsson – Parallelizing the physics solver – BSC 2025

77K views • 1 year ago
Better Software Conference
Dennis Gustafsson, creator of Teardown, presents how he parallelized the physics solver for an upcoming game, followed by a Q&A. The talk was given at the Better Software Conference 2025.
Brian Beckman: Don't fear the Monad1:07:10

Brian Beckman: Don't fear the Monad

415K views • 13 years ago
jasonofthel33t
Microsoft's Brian Beckman gives an hour-long, whiteboard-style walk through monads, building from function composition and monoids using school-level math. It is aimed at practicing programmers rather than category theorists.
Topic match · Logic & formal methods
The Future of Mathematics?1:14:48

The Future of Mathematics?

116K views • 7 years ago
Microsoft Research
Mathematician Kevin Buzzard explains why he believes the Lean theorem prover will shape the future of mathematics, and describes digitizing his university curriculum in Lean with undergraduates, plus the cultural challenges.
Topic match · Logic & formal methods
2017 ACM PPoPP Keynote: It's Time for a New Old Language1:12:12

2017 ACM PPoPP Keynote: It's Time for a New Old Language

7K views • 9 years ago
Guy Steele
Guy Steele's PPoPP 2017 keynote surveying the history of computer science metanotation, including BNF, inference rules, and overline notation. He argues the field's notations are inconsistent and fragmented.
Topic match · Logic & formal methods
MIT Godel Escher Bach Lecture 11:02:34

MIT Godel Escher Bach Lecture 1

557K views • 13 years ago
jasonofthel33t
The first lecture of an MIT course on Douglas Hofstadter's Godel, Escher, Bach, covering themes like self-reference, recursion and incompleteness. The full lecture series is on YouTube.
Topic match · Logic & formal methods
Scott Aaronson | How Much Math Is Knowable?1:06:43

Scott Aaronson | How Much Math Is Knowable?

58K views • 1 year ago
Harvard CMSA
Scott Aaronson's Harvard CMSA talk traces what mathematical truths are knowable, from Godel and Turing to the Busy Beaver function. He covers recent work on Busy Beaver values.
Topic match · Logic & formal methods