<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
    <channel>
        <title>Proof That Computers Can't Do Everything (The Halting Problem)</title>
        <link>https://tube.fede.re/videos/watch/99ffac5e-55e8-449a-9c64-68f83629cad8</link>
        <description>If you disagree or get confused by this video, read this FAQ: https://www.udiprod.com/halting-problem/#faq Visit my home page:  https://www.udiprod.com This video gives an informal presentation of Alan Turing's Halting Theorem, a serious, highly influential result in computer science. A few more comments on this video: This video skips a lot of technicalities for sake of simplicity. There are many rigorous descriptions of this proof easily found on the web., There really is an unbeatable checkers machine. See here: http://en.wikipedia.org/wiki/Draughts#Computer_draughts, Imported from https://www.youtube.com/watch?v=92WHN-pAFCs&amp;feature=youtu.be</description>
        <lastBuildDate>Sun, 11 Oct 2026 04:30:37 GMT</lastBuildDate>
        <docs>https://validator.w3.org/feed/docs/rss2.html</docs>
        <generator>PeerTube - https://tube.fede.re</generator>
        <image>
            <title>Proof That Computers Can't Do Everything (The Halting Problem)</title>
            <url>https://tube.fede.re/client/assets/images/icons/icon-1500x1500.png</url>
            <link>https://tube.fede.re/videos/watch/99ffac5e-55e8-449a-9c64-68f83629cad8</link>
        </image>
        <copyright>All rights reserved, unless otherwise specified in the terms specified at https://tube.fede.re/about and potential licenses granted by each content's rightholder.</copyright>
        <atom:link href="https://tube.fede.re/feeds/video-comments.xml?videoId=99ffac5e-55e8-449a-9c64-68f83629cad8" rel="self" type="application/rss+xml"/>
    </channel>
</rss>