turing complete

Tom Wildenhain's guest lecture for CMU's Esoteric Programming Languages course shows that PowerPoint transitions and slides are Turing complete without macros, building up to a mind-bending fractal ending.

Hennessy and Patterson's 2018 Turing Award lecture at ISCA, A New Golden Age for Computer Architecture. It covers domain-specific hardware, security, open instruction sets and agile chip development.

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.

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.

A lecture by Noam Chomsky on thought control in democratic societies, covering propaganda and manufacturing consent. The upload has no description.

University of Chicago lecture in which John Mearsheimer argues the West, through NATO and EU expansion, bears primary responsibility for the Ukraine crisis. He also discusses how to end it and its consequences.

A 1983 Los Angeles lecture by KGB defector Yuri Bezmenov on how the Soviets carried out ideological subversion of target societies through propaganda. He walks through demoralization and normalization stages.

Turing Award winner Michael Stonebraker gives the 2018 Donald B. Gillies Memorial Lecture at Illinois. He discusses the gap between academic research and industry problems, publishing incentives, and the influence of large industry users on research.

Vladimir Voevodsky's IAS lecture starts from Godel's second incompleteness theorem to explore whether first-order arithmetic could be inconsistent. It motivates his vision of univalent foundations and computer-checked proofs.

Gabriel Lebec's Fullstack Academy talk introduces lambda calculus syntax, the history of mathematical logic, and the essence of functional programming using JavaScript. It also covers combinators, currying and Church encodings.

The first lecture of Michael Sipser's MIT 18.404J Theory of Computation course, covering course mechanics, finite automata, regular languages and regular expressions. It proves closure of regular languages under union and begins concatenation.

An excerpt from Hal Abelson's opening SICP lecture introducing computer science and contrasting declarative and imperative knowledge. He argues that computer science is not really a science and is more like magic or engineering of ideas.

An excerpt of Richard Feynman's 1985 lecture Q&A about whether machines can think. He discusses the difficulty of defining what computers can never do and compares machine intelligence to machines that don't copy animals.

Database pioneer Michael Stonebraker argues that 'big data' is really at least four different problems: big volumes with small analytics, big analytics, velocity, and variety. He comments on where each market is heading.

An eight-minute excerpt of a 1983 video featuring Seymour Papert, creator of Logo, on children learning programming and abstract ideas through embodied play. It shows kids acting out the Logo turtle.

A clip of psychologist Jordan Peterson lecturing on intelligence and IQ, covering how it is defined and its correlation with academic and work success.

The full 1973 BBC Lighthill debate on artificial intelligence, featuring James Lighthill, Donald Michie, Richard Gregory and John McCarthy. It documents the argument that preceded the 1970s AI winter and includes early robot demos.