<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
    <channel>
        <title>The greatest unsolved problem in computer science...</title>
        <link>https://tube.grossholtz.net/videos/watch/9c06aaa0-84bf-4f79-9ae3-7a771e14f34f</link>
        <description>Try MongoDB Atlas for free - https://fandf.co/4rf61Za and simplify your AI data stack with one platform. P vs NP is arguably the most famous unsolved problem in computer science. It asks: if you can verify a solution quickly, can you also find the solution quickly? Let's attempt to find out... Clay Mathematics Institute: https://www.claymath.org/millennium/p-vs-np/ #coding #programming 🔖 Topics Covered What is P vs NP, History of P vs NP, Why is it so hard to prove?, Underlying mathematical concepts, Uses for P vs NP, What if P really does equal NP?, Want more Fireship? 🗞️ Newsletter: https://bytes.dev 🧠 Courses: https://fireship.dev</description>
        <lastBuildDate>Mon, 06 Apr 2026 03:11:27 GMT</lastBuildDate>
        <docs>https://validator.w3.org/feed/docs/rss2.html</docs>
        <generator>PeerTube - https://tube.grossholtz.net</generator>
        <image>
            <title>The greatest unsolved problem in computer science...</title>
            <url>https://tube.grossholtz.net/client/assets/images/icons/icon-512x512.png</url>
            <link>https://tube.grossholtz.net/videos/watch/9c06aaa0-84bf-4f79-9ae3-7a771e14f34f</link>
        </image>
        <copyright>All rights reserved, unless otherwise specified in the terms specified at https://tube.grossholtz.net/about and potential licenses granted by each content's rightholder.</copyright>
        <atom:link href="https://tube.grossholtz.net/feeds/video-comments.xml?videoId=9c06aaa0-84bf-4f79-9ae3-7a771e14f34f" rel="self" type="application/rss+xml"/>
    </channel>
</rss>