<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/articles/feed.xsl"?>
<rss version="2.0"><channel><title>Keep Learning · Articles</title><link>https://keep2learning.com/articles/</link><description>Articles by Ayman Hindy</description>
<item><title>If Hard Problems Are Hard, Why Does Machine Learning Work?</title><link>https://keep2learning.com/articles/p-vs-np-and-machine-learning/</link><guid>https://keep2learning.com/articles/p-vs-np-and-machine-learning/</guid><pubDate>Wed, 14 Oct 2026 12:00:00 GMT</pubDate><description>Some problems are believed to be hard to solve in general, yet machine learning handles many practical instances. Four distinctions show why there is no contradiction.</description></item>
</channel></rss>
