Turing & The Halting Problem - Computerphile
Computerphile2 HN recommenders · recommended in 2 months, 2019-2022
919K views · 12 years ago · explainer · evergreen
A Computerphile video in which Mark Jago of the University of Nottingham explains Turing's halting problem and how it led to the blueprint for the modern computer.
Offered as a short, clear explanation of the halting problem and its link to decidability.
10:44P vs. NP and the Computational Complexity Zoo
hackerdashery
3.7M views • 12 years ago
34:00Math's Fundamental Flaw
Veritasium
30.8M views • 5 years ago
1:00:341. Introduction, Finite Automata, Regular Expressions
MIT OpenCourseWare
626K views • 5 years ago
5:34On The Turing Completeness of PowerPoint (SIGBOVIK)
Tom Wildenhain
1.2M views • 9 years ago
51:32Great Impractical Ideas in Computer Science: PowerPoint Programming
Tom Wildenhain
2.2M views • 7 years ago
3:38:43Stephen Wolfram: Complexity and the Fabric of Reality | Lex Fridman Podcast #234
Lex Fridman
4.8M views • 5 years ago
1:02:34MIT Godel Escher Bach Lecture 1
jasonofthel33t
557K views • 13 years ago
36:14Barliman: trying the halting problem backwards, blindfolded - William Byrd, Greg Rosenblatt
ClojureTV
8K views • 9 years ago
1:06:43Scott Aaronson | How Much Math Is Knowable?
Harvard CMSA
58K views • 1 year ago
42:43"Propositions as Types" by Philip Wadler
Strange Loop Conference
143K views • 11 years ago
10:00SICP / What is "Computer Science" ?
LarryNorman
131K views • 20 years ago
48:36Matt Might - Winning the War on Error Solving the Halting Problem and Curing Cancer
Curry On!
9K views • 9 years ago
1:02:15Lambda Calculus - Fundamentals of Lambda Calculus & Functional Programming in JavaScript
Fullstack Academy
227K views • 9 years ago
7:42Extremely Large Numbers 1 - Introduction
Giroux Studios
20K views • 11 years ago
22:54I Built a COMPUTER in Magic: The Gathering
Because Science
2M views • 7 years ago
10:58Flaw in the Enigma Code - Numberphile
Numberphile
5.4M views • 13 years ago
59:2328c3: The Science of Insecurity
28c3
42K views • 14 years ago
3:26:34David Beazley - Lambda Calculus from the Ground Up - PyCon 2019
PyCon 2019
52K views • 7 years ago
14:27All the Numbers - Numberphile
Numberphile
1.8M views • 7 years ago
3:11:09Stephen Wolfram: Cellular Automata, Computation, and Physics | Lex Fridman Podcast #89
Lex Fridman
1.8M views • 6 years ago
4 comments from Hacker News
no, it's all in software because you can create any smart contract and it can call any other. There is a difference in knowing after the transaction has finalized and predicting beforehand, which is when you would want to block the transaction. ▶ this video
In my view, this isn't really a software problem. Your plan is on the right track though. We already know its neigh impossible to ensure software is bug and vuln free. We have to reckon with the fact that secure software is possible, but extremely hard and impractical to achieve with any regularity. Because of well known computer science problems such as the Halting Problem[0] and more that I am totally ignorant of, the only alternative is extremely thorough verification like happens in planes[1]. The rub is that unlike aerospace and other critical controls, we cannot define the software security problem as closely as is possible in those other critical systems. Doing so will undo the benefits of our general technology solutions. The reason I claim it is nonetheless not a software problem is: In case after case of these troubling examples of security failures, there are only a few organizational commonalities that link them all together. Time after time, there are shocking misconfigurations, corners cut, best practices eschewed, warnings ignored, processes disregarded or absent and swept under the rug. C-Suite execs, as has been well noted, opt for the checkbox-style silver-bullet-whiz-bang, because they can understand the value proposition of one-problem-one-fix and it is easy to communicate to stakeholders. They are totally ignorant to and uninterested in the details of actually providing a quality product. Their product is often not what they are selling; They are getting
>Like what? The halting problem is (I think?) the standard example. Here's a short video on it ▶ this video
For one practical example, Gödel's incompleteness is directly related to decidability problems in CS. there's this glorious liar paradox machine discussed by Computerphile [0]. [0] ▶ this video