Skip to content
HomeVideos
AllLongsCategoriesPlaylists
BooksBlogsPodcasts
HistoryListsWatch laterLiked videosFollowing

The videos, books, blogs and podcasts Hacker News keeps recommending, all in one place.

VideosBooksBlogsPodcastsAboutPrivacySettings

Data from Hacker News, HackerTube, HackerBooks, HackerBlogs and Open Library. Credits · Not affiliated with Y Combinator.

HomeVideosBooksBlogsPodcasts
Ctrl K

    Turing & The Halting Problem - Computerphile

    Computerphile

    2 HN recommenders · recommended in 4 months, 2019–2022

    YouTube

    6:14 · 919K views · Aug 21, 2014

    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.

    Mathematics & Theoretical CSComputability & complexity theory
    1. 10:44
      P vs. NP and the Computational Complexity Zoohackerdashery3.7M views • 12 years ago
    2. 34:00
      Math's Fundamental FlawVeritasium31M views • 5 years ago
    3. 5:34
      On The Turing Completeness of PowerPoint (SIGBOVIK)Tom Wildenhain1.2M views • 9 years ago
    4. 1:00:34
      1. Introduction, Finite Automata, Regular ExpressionsMIT OpenCourseWare628K views • 5 years ago
    5. 51:32
      Great Impractical Ideas in Computer Science: PowerPoint ProgrammingTom Wildenhain2.2M views • 7 years ago
    6. 3:38:43
      Stephen Wolfram: Complexity and the Fabric of Reality | Lex Fridman Podcast #234Lex Fridman4.8M views • 5 years ago
    7. 42:43
      "Propositions as Types" by Philip WadlerStrange Loop Conference144K views • 11 years ago
    8. 1:02:34
      MIT Godel Escher Bach Lecture 1jasonofthel33t557K views • 13 years ago
    9. 36:14
      Barliman: trying the halting problem backwards, blindfolded - William Byrd, Greg RosenblattClojureTV7.9K views • 9 years ago
    10. 59:23
      28c3: The Science of Insecurity28c342K views • 14 years ago
    11. 1:02:15
      Lambda Calculus - Fundamentals of Lambda Calculus & Functional Programming in JavaScriptFullstack Academy228K views • 9 years ago
    12. 48:36
      Matt Might - Winning the War on Error Solving the Halting Problem and Curing CancerCurry On!8.9K views • 9 years ago
    13. 14:27
      All the Numbers - NumberphileNumberphile1.8M views • 7 years ago
    14. 1:07:10
      Brian Beckman: Don't fear the Monadjasonofthel33t415K views • 13 years ago
    15. 10:58
      Flaw in the Enigma Code - NumberphileNumberphile5.4M views • 13 years ago
    16. 1:07:22
      Invited Talk - Guy SteeleClojureTV39K views • 9 years ago
    17. 1:06:43
      Scott Aaronson | How Much Math Is Knowable?Harvard CMSA58K views • 1 year ago
    18. 3:26:34
      David Beazley - Lambda Calculus from the Ground Up - PyCon 2019PyCon 201952K views • 7 years ago
    19. 22:54
      I Built a COMPUTER in Magic: The GatheringBecause Science2M views • 7 years ago
    20. 7:42
      Extremely Large Numbers 1 - IntroductionGiroux Studios20K views • 11 years ago

    4 comments from Hacker News

    1. @mar77iDec 2019· in “Kurt Gödel and the Mechanization of Mathematics”

      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

      RecommendsView on HN
    2. @gammalostJun 2021· in “DeepMind says reinforcement learning is ‘enough’ to reach general AI”

      >Like what? The halting problem is (I think?) the standard example. Here's a short video on it this video

      RecommendsView on HN
    3. @cartoonworldJul 2021· in “Up to 1,500 businesses affected by ransomware attack, Kaseya CEO says”

      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

      CitesView on HN
    4. @verdvermAug 2022· in “Tornado Cash and collateral damage”

      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

      CitesView on HN