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

    P vs. NP and the Computational Complexity Zoo

    hackerdashery

    4 HN recommenders · recommended in 8 months, 2015–2026

    YouTube

    10:44 · 3.7M views · Aug 26, 2014

    An 11-minute animated introduction to P vs. NP and the wider landscape of complexity classes, inspired by the Complexity Zoo wiki. It assumes no background in computer science.

    HN repeatedly recommends it as the best short, funny introduction to P vs. NP and complexity classes for people with no background.

    Mathematics & Theoretical CSComputability & complexity theoryRecreational & visual math
    1. 40:42
      Lucas Cavalcanti & Edward Wible - Exploring four hidden superpowers of DatomicClojureTV29K views • 11 years ago
    2. 7:48
      Conway's Game Of Life in APLDyalog236K views • 17 years ago
    3. 17:58
      What P vs NP is actually aboutPolylog257K views • 2 years ago
    4. 6:14
      Turing & The Halting Problem - ComputerphileComputerphile919K views • 12 years ago
    5. 5:34
      On The Turing Completeness of PowerPoint (SIGBOVIK)Tom Wildenhain1.2M views • 9 years ago
    6. 1:00:34
      1. Introduction, Finite Automata, Regular ExpressionsMIT OpenCourseWare628K views • 5 years ago
    7. 42:43
      "Propositions as Types" by Philip WadlerStrange Loop Conference144K views • 11 years ago
    8. 1:02:15
      Lambda Calculus - Fundamentals of Lambda Calculus & Functional Programming in JavaScriptFullstack Academy228K views • 9 years ago
    9. 34:00
      Math's Fundamental FlawVeritasium31M views • 5 years ago
    10. 51:32
      Great Impractical Ideas in Computer Science: PowerPoint ProgrammingTom Wildenhain2.2M views • 7 years ago
    11. 3:26:34
      David Beazley - Lambda Calculus from the Ground Up - PyCon 2019PyCon 201952K views • 7 years ago
    12. 7:42
      Extremely Large Numbers 1 - IntroductionGiroux Studios20K views • 11 years ago
    13. 1:30
      Life in lifePhillip Bradbury4.1M views • 14 years ago
    14. 32:32
      The Strange Math That Predicts (Almost) AnythingVeritasium13M views • 1 year ago
    15. 1:01:39
      "Simple Made Easy" - Rich Hickey (2011)Strange Loop Conference220K views • 5 years ago
    16. 57:03
      HACKENBUSH: a window to a new world of mathOwen Maitzen562K views • 5 years ago
    17. 1:06:43
      Scott Aaronson | How Much Math Is Knowable?Harvard CMSA58K views • 1 year ago
    18. 53:22
      Ruby Conf 12 - Y Not- Adventures in Functional Programming by Jim WeirichConfreaks66K views • 13 years ago
    19. 59:23
      28c3: The Science of Insecurity28c342K views • 14 years ago
    20. 1:07:22
      Invited Talk - Guy SteeleClojureTV39K views • 9 years ago

    8 comments from Hacker News

    1. @sgroveMay 2023· in “Problems harder than NP-Complete”

      My absolute favorite overview of this - the video goes over both the explanation of the spaces, but also how it relates to a sort of understanding of reality itself! this video

      Strongly recommendsView on HN
    2. @sgroveDec 2017· in “Classic Nintendo Games Are NP-Hard (2012)”

      There's a fantastic video I refer to every now and then if I'm a bit unsure about it, definitely recommend it - this video

      Strongly recommendsView on HN
    3. @jlg23Jun 2017· in “The asymmetry in storytelling between math and the other sciences”

      > I would guess the P!=NP proof would be an example. Unfortunately, it doesn't have any easy description that the average person would understand. "Hard. Really hard. Don't be ridiculous.". Now backtrack 2 small examples on paper. Oh, look, the number of steps here grow, but these grow even faster! Especially mathematics when explained to a layperson so much depends on the language used. If one manages to keep the rest of the complexity zoo[1] out of the explanation and invests time into very basic examples, a lot things can be explained that otherwise the average person would not understand. [1] [LINK] EDIT: Looking for a video I stumbled upon last week that had a very nice, short explanation of P vs NP (which I did not find again), I found this one: Not lay-person simple, but very funny and also provides a cursory glance at what lies beyond P vs NP, i.e. the complexity zoo: this video (10 min)

      RecommendsView on HN
    4. @austinlNov 2016· in “The P=?NP Poll (2002) [pdf]”

      This 10 minute video is a great introduction to the P = NP problem and computational complexity theory if you have no context. I've shown this to plenty of friends (including those outside of computer science). Essentially, "does being able to quickly recognize correct answers mean there's also a quick way to find them?" this video

      RecommendsView on HN
    5. @d23Jan 2017· in “P vs. NP”

      A guy at a company I used to work for made a great video on this. Very understandable even without any background on the topic: this video

      RecommendsView on HN