<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Algorithms on Hanh Pham's Blog</title><link>https://hanhpham.vercel.app/tags/algorithms/</link><description>Recent content in Algorithms on Hanh Pham's Blog</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Wed, 30 Sep 2026 16:00:00 +0700</lastBuildDate><atom:link href="https://hanhpham.vercel.app/tags/algorithms/index.xml" rel="self" type="application/rss+xml"/><item><title>Can Every Problem Be Solved by an Algorithm? Alan Turing's 1936 Proof</title><link>https://hanhpham.vercel.app/posts/alan-turing-computable-numbers-entscheidungsproblem/</link><pubDate>Wed, 30 Sep 2026 16:00:00 +0700</pubDate><guid>https://hanhpham.vercel.app/posts/alan-turing-computable-numbers-entscheidungsproblem/</guid><description>A step-by-step deconstruction of Alan Turing&amp;rsquo;s 1936 paper: how formalizing the mechanical computer and adapting Cantor&amp;rsquo;s diagonal argument proved that algorithmic omniscience is mathematically impossible.</description></item></channel></rss>