Turing & The Halting Problem - Computerphile
Computerphile2 HN recommenders · recommended in 2 months, 2019–2022
explainer · intro · evergreen · 2019–2022 on HN
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.
Up next
18 mo on HNRuby Conf 12 - Y Not- Adventures in Functional Programming by Jim Weirich
Confreaks
17 HN recommender · 2013–2026
9 mo on HN28c3: The Science of Insecurity
28c3
9 HN recommender · 2012–2024
8 mo on HN"Propositions as Types" by Philip Wadler
Strange Loop Conference
9 HN recommender · 2015–2026
7 mo on HNBreak Me00 The MoVfuscator Turning mov into a soul crushing RE nightmare Christopher Domas
Adrian Crenshaw
6 HN recommender · 2017–2026
7 mo on HNMath's Fundamental Flaw
Veritasium
7 HN recommender · 2021–2024
6 mo on HNOn The Turing Completeness of PowerPoint (SIGBOVIK)
Tom Wildenhain
8 HN recommender · 2017–2025
6 mo on HNLife in life
Phillip Bradbury
6 HN recommender · 2013–2025
5 mo on HNLambda Calculus - Fundamentals of Lambda Calculus & Functional Programming in JavaScript
Fullstack Academy
5 HN recommender · 2019–2024
6 mo on HNAll the Numbers - Numberphile
Numberphile
6 HN recommender · 2019–2025
5 mo on HNP vs. NP and the Computational Complexity Zoo
hackerdashery
4 HN recommender · 2015–2026
4 mo on HNRuby Manor 3 - Programming with Nothing by Tom Stuart
Confreaks
4 HN recommender · 2013–2019
4 mo on HNDavid Beazley - Lambda Calculus from the Ground Up - PyCon 2019
PyCon 2019
4 HN recommender · 2019–2021
4 comments from Hacker News
>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
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