<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Loudcoder — Yiping Deng</title><link>https://loudcoder.com/blog/</link><description>Notes on code, computer science, and the ideas underneath.</description><language>en</language><atom:link href="https://loudcoder.com/feed.xml" rel="self" type="application/rss+xml"/><item><title>Hilbert’s tenth: from machines to equations, and a new rational-case claim</title><link>https://loudcoder.com/blog/hilberts-tenth-from-machines-to-rationals/</link><guid isPermaLink="true">https://loudcoder.com/blog/hilberts-tenth-from-machines-to-rationals/</guid><pubDate>Wed, 07 Oct 2026 12:00:00 GMT</pubDate><description>How integer equations encode computation, what formalization checks, and how to read OpenAI’s model-generated claim over the rationals.</description></item><item><title>React With Higher Order Component</title><link>https://loudcoder.com/blog/react-with-higher-order-component/</link><guid isPermaLink="true">https://loudcoder.com/blog/react-with-higher-order-component/</guid><pubDate>Sun, 19 Aug 2018 01:43:00 GMT</pubDate><description>Mixing data-fetching behavior into React components with a reusable higher-order component.</description></item><item><title>Learn Computer Science From Scratch -- Map and Reduce in Function world</title><link>https://loudcoder.com/blog/map-and-reduce/</link><guid isPermaLink="true">https://loudcoder.com/blog/map-and-reduce/</guid><pubDate>Sun, 05 Aug 2018 21:13:00 GMT</pubDate><description>A hands-on introduction to map, reduce, and counting characters with Haskell.</description></item><item><title>Learn Computer Science From Scratch - Boyer-Moore Algorithm</title><link>https://loudcoder.com/blog/boyer-moore-algorithm/</link><guid isPermaLink="true">https://loudcoder.com/blog/boyer-moore-algorithm/</guid><pubDate>Sun, 05 Aug 2018 21:13:00 GMT</pubDate><description>A look at string searching, the bad-character rule, and the good-suffix rule.</description></item><item><title>Hilbert 10 meets Isabelle</title><link>https://loudcoder.com/blog/hilbert-10-meets-isabelle/</link><guid isPermaLink="true">https://loudcoder.com/blog/hilbert-10-meets-isabelle/</guid><pubDate>Sun, 05 Aug 2018 21:13:00 GMT</pubDate><description>Diophantine equations, Hilbert’s tenth problem, and the beginnings of a formalisation project in Isabelle.</description></item><item><title>Learn Computer Science From Scratch - Recursive Functions</title><link>https://loudcoder.com/blog/recursive-functions/</link><guid isPermaLink="true">https://loudcoder.com/blog/recursive-functions/</guid><pubDate>Sun, 05 Aug 2018 21:13:00 GMT</pubDate><description>Thinking through recursion in Haskell, from a simple sum to the Fibonacci sequence.</description></item><item><title>Learn Computer Science From Scratch - Complexity and Correctness</title><link>https://loudcoder.com/blog/complexity-and-correctness/</link><guid isPermaLink="true">https://loudcoder.com/blog/complexity-and-correctness/</guid><pubDate>Sun, 05 Aug 2018 21:13:00 GMT</pubDate><description>What makes an algorithm scalable — and what it actually means for an algorithm to be correct.</description></item><item><title>Learn Computer Science from Scratch -- Recursive Function Revisted</title><link>https://loudcoder.com/blog/recursive-functions-revisited/</link><guid isPermaLink="true">https://loudcoder.com/blog/recursive-functions-revisited/</guid><pubDate>Sun, 05 Aug 2018 21:13:00 GMT</pubDate><description>Divide, conquer, and combine: a closer look at recursive algorithms and repeated work.</description></item></channel></rss>
