<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: sat_solver</title><link>https://news.ycombinator.com/user?id=sat_solver</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Tue, 07 Jul 2026 08:25:12 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=sat_solver" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by sat_solver in "Are we the baddies?"]]></title><description><![CDATA[
<p>Play stupid games, win stupid prizes. I'm not talking about only dating apps. Wherever there's an algo, there's someone manipulating you. I just deleted and disabled my Youtube history. It's incredibly liberating!</p>
]]></description><pubDate>Sun, 06 Jul 2025 07:17:15 +0000</pubDate><link>https://news.ycombinator.com/item?id=44478550</link><dc:creator>sat_solver</dc:creator><comments>https://news.ycombinator.com/item?id=44478550</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44478550</guid></item><item><title><![CDATA[New comment by sat_solver in "Is gravity just entropy rising? Long-shot idea gets another look"]]></title><description><![CDATA[
<p>You're thinking of information entropy, which is not the same concept as entropy in physics. An ice cube in a warm room can be described using a minimum description length as "ice cube in a warm room" (or a crystal structure inside a fluid space), but if you wait until the heat death of the universe, you just have "a warm room" (a smooth fluid space), which will have an even shorter mdl. Von Neuman should never have repurposed the term entropy from physics. Entropy confuses a lot of people, including me.</p>
]]></description><pubDate>Mon, 16 Jun 2025 11:10:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=44288451</link><dc:creator>sat_solver</dc:creator><comments>https://news.ycombinator.com/item?id=44288451</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44288451</guid></item><item><title><![CDATA[New comment by sat_solver in "AI-designed chips are so weird that 'humans cannot understand them'"]]></title><description><![CDATA[
<p>Bug zapper</p>
]]></description><pubDate>Mon, 24 Feb 2025 16:54:07 +0000</pubDate><link>https://news.ycombinator.com/item?id=43161764</link><dc:creator>sat_solver</dc:creator><comments>https://news.ycombinator.com/item?id=43161764</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43161764</guid></item><item><title><![CDATA[I solved SAT (boolean satisfiability), what now?]]></title><description><![CDATA[
<p>Hi all, I discovered a solution to the SAT problem (boolean satisfiability) that runs in time complexity O(n*log(m)), and space O(2^n), where m is the number of inputs and n is the number of boolean operations. I have spent a few months solving various SAT problems with a program I wrote. I'm a senior in high school. What should I do? Advice would be appreciated. Thank you in advance.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=38259859">https://news.ycombinator.com/item?id=38259859</a></p>
<p>Points: 1</p>
<p># Comments: 3</p>
]]></description><pubDate>Tue, 14 Nov 2023 06:31:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=38259859</link><dc:creator>sat_solver</dc:creator><comments>https://news.ycombinator.com/item?id=38259859</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=38259859</guid></item></channel></rss>