<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: Smaug123</title><link>https://news.ycombinator.com/user?id=Smaug123</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Sat, 21 Nov 2026 00:08:23 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=Smaug123" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by Smaug123 in "Why do we need human mathematicians anymore?"]]></title><description><![CDATA[
<p>Sorry, I assumed the inductive construction was implied; you can indeed describe properties of that particular interesting problem (though of course you can’t hold its definition in your head), so it goes in the list. Keep going. At some point you’ll hit problems where the process of constructing the problem doesn’t even fit in a brain, etc. There are at least countably many problems, but finitely many problems which any algorithm-which-fits-in-the-brain can describe given finitely many inputs-which-fit-in-the-brain.<p>This isn’t an enormously important point - the actual question at issue is an empirical one, “in a steady state, can we produce interesting problems at a rate that exceeds our ability to solve them and integrate our understanding” or something like that - but I did rankle at a “trivial” proof which is invalid due to equivocating between multiple definitions of the word “interesting” (which should really take an object, “interesting to me” vs “interesting to something smarter than me”).</p>
]]></description><pubDate>Mon, 21 Sep 2026 07:02:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=49783940</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49783940</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49783940</guid></item><item><title><![CDATA[New comment by Smaug123 in "Why do we need human mathematicians anymore?"]]></title><description><![CDATA[
<p>An interesting problem must have a description that fits in a brain, at least for now. Your description-length argument assumes arbitrarily large storage.</p>
]]></description><pubDate>Mon, 21 Sep 2026 02:13:31 +0000</pubDate><link>https://news.ycombinator.com/item?id=49782292</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49782292</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49782292</guid></item><item><title><![CDATA[New comment by Smaug123 in "If math is more than proof, we need to better celebrate the rest of it"]]></title><description><![CDATA[
<p>I'd be interested in hearing a field report on this! For example, I can easily imagine that they're great at walking through the proof step by step, explaining background as necessary; but as TFA notes, one of the most important questions is "why is this definition the way it is?", and my bet would be that the Lean is not enough to help the LLMs meaningfully in answering that.</p>
]]></description><pubDate>Sat, 19 Sep 2026 07:47:19 +0000</pubDate><link>https://news.ycombinator.com/item?id=49764320</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49764320</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49764320</guid></item><item><title><![CDATA[New comment by Smaug123 in "I vibed a proof of Conway's conjecture"]]></title><description><![CDATA[
<p>I mean, I was <i>intending</i> to supply the words that would link the LLM’s explanation to a more normal one, not to explain it; apparently that was extremely unclear. An actual explanation is much longer, as indeed I attempted to indicate by pointing to Wikipedia and saying that it might be more clear.<p>“Doing better than a totally useless explanation in fewer characters” is in general impossible, of course, eg if the first explanation has only one character.</p>
]]></description><pubDate>Fri, 18 Sep 2026 15:20:37 +0000</pubDate><link>https://news.ycombinator.com/item?id=49755678</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49755678</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49755678</guid></item><item><title><![CDATA[New comment by Smaug123 in "I vibed a proof of Conway's conjecture"]]></title><description><![CDATA[
<p>(Apparently I was extremely unclear with this text. For clarity: if you want to actually understand surreal numbers, go and read On Numbers and Games, by Conway, which is a delightful book; or get an LLM to talk you through Wikipedia. Original text follows.)<p>It’s a terrible explanation. A surreal number is defined as a pair of sets of surreal numbers (where you fiddle around the recursion in that definition by defining them in waves, so strictly speaking you’re defining “the surreal numbers born at time T” for each individual T given access to the surreal numbers born at all earlier times, and then you “take the union across all times”, scare quotes because there are too many times for this to result in a set). Zero is a surreal number but the LLM is using the word “zero” to mean “the set containing just the surreal number 0”; “nothing” here is the LLM’s obtuse word for the empty set. Wikipedia may actually be easier to follow.</p>
]]></description><pubDate>Fri, 18 Sep 2026 15:00:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=49755365</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49755365</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49755365</guid></item><item><title><![CDATA[New comment by Smaug123 in "Bend 2 and the Vibe-Coding Trap"]]></title><description><![CDATA[
<p>This is probably not necessarily true. “f: list[1 A] -> list[A] pure, worst-case time n log n, such that for all x and 0 <= i <= j < len(x), f(x)[i] <= f(x)[j]” is probably good enough for nearly everyone unless the program synthesiser is actively adversarial; probably 99.999% of the list-sorting in the world is done via standard library functions anyway, which suggests that people don’t much care exactly how it happens.</p>
]]></description><pubDate>Fri, 18 Sep 2026 12:52:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=49753709</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49753709</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49753709</guid></item><item><title><![CDATA[New comment by Smaug123 in "Detecting and countering misuse of AI: September 2026"]]></title><description><![CDATA[
<p>The question pertinent to your decision is "do I want to see more of this on Hacker News, or less?".</p>
]]></description><pubDate>Fri, 11 Sep 2026 06:10:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=49654135</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49654135</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49654135</guid></item><item><title><![CDATA[New comment by Smaug123 in "AI could kill all humans in next decade, warn experts"]]></title><description><![CDATA[
<p>Would it? Don’t they all desperately want more compute, and not the banning of new data centres?</p>
]]></description><pubDate>Wed, 09 Sep 2026 16:33:16 +0000</pubDate><link>https://news.ycombinator.com/item?id=49629200</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49629200</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49629200</guid></item><item><title><![CDATA[New comment by Smaug123 in "You Don't Have a Right to Safe Drinking Water, US Court Rules"]]></title><description><![CDATA[
<p>I don’t have skin in this game, being from the increasingly oppressive UK and not the USA, but:<p>> what do you want to defend<p>Accuracy, and in this case people <i>correctly</i> knowing that their rights stem from some source (if they do! I don’t know the legal facts) or knowing the appropriate venue in which to campaign for them, rather than incorrectly believing that they don’t have rights and/or can’t get them.<p>> why do you want to defend it<p>Because words still have meanings, and people pretending they don’t, while screaming in ever more shrill tones at each other, is extremely tiresome, and the Internet is full of it.</p>
]]></description><pubDate>Sun, 06 Sep 2026 17:59:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=49589083</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49589083</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49589083</guid></item><item><title><![CDATA[New comment by Smaug123 in "You Don't Have a Right to Safe Drinking Water, US Court Rules"]]></title><description><![CDATA[
<p>As the article says, the situation in Jackson was deplorable; and it is indeed mind-boggling (to my puny European mind) that the same constitution which grants freedom of speech and the press was also not intended to grant the right to receive only believed-correct information from the government. But the ruling, for example, is not quoted as making any mention of any federal laws? The headline may be true for all I know, but the article provides only evidence for its truth about one particular source of rights.</p>
]]></description><pubDate>Sun, 06 Sep 2026 10:06:31 +0000</pubDate><link>https://news.ycombinator.com/item?id=49584963</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49584963</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49584963</guid></item><item><title><![CDATA[New comment by Smaug123 in "You Don't Have a Right to Safe Drinking Water, US Court Rules"]]></title><description><![CDATA[
<p>Sorry, I think your pull quote is actually contradicting your gloss. Again, the pull quote states that it doesn’t infringe any <i>constitutional</i> right, not that it doesn’t infringe any rights granted for any other reason?</p>
]]></description><pubDate>Sun, 06 Sep 2026 10:01:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=49584928</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49584928</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49584928</guid></item><item><title><![CDATA[New comment by Smaug123 in "You Don't Have a Right to Safe Drinking Water, US Court Rules"]]></title><description><![CDATA[
<p>Does it? I think that conclusion requires observing additionally that all federal law also fails to grant a right to safe drinking water, doesn’t it?</p>
]]></description><pubDate>Sun, 06 Sep 2026 09:58:58 +0000</pubDate><link>https://news.ycombinator.com/item?id=49584914</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49584914</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49584914</guid></item><item><title><![CDATA[New comment by Smaug123 in "You Don't Have a Right to Safe Drinking Water, US Court Rules"]]></title><description><![CDATA[
<p>Misleadingly provocative headline, right? The actual ruling from the article is that <i>the US Constitution</i> does not by itself grant US citizens that right. As the article itself points out, there’s nothing stopping other agreements from granting the right, and indeed several states do so explicitly.</p>
]]></description><pubDate>Sun, 06 Sep 2026 09:50:34 +0000</pubDate><link>https://news.ycombinator.com/item?id=49584859</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49584859</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49584859</guid></item><item><title><![CDATA[New comment by Smaug123 in "Formalizing Fermat's Last Theorem"]]></title><description><![CDATA[
<p>It’s an aggregated list, not a list of formalisations in Lean - the checkbox is “things formalised in <i>any</i> prover”.</p>
]]></description><pubDate>Sat, 05 Sep 2026 19:20:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=49579748</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49579748</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49579748</guid></item><item><title><![CDATA[New comment by Smaug123 in "Formalizing Fermat's Last Theorem"]]></title><description><![CDATA[
<p>Because you wrote:<p>> what are exactly rules, which could be separate topic of research, this detail is skipped<p>I am now confident you’re a troll, though, so I am going to bow out.</p>
]]></description><pubDate>Sat, 05 Sep 2026 16:50:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=49578344</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49578344</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49578344</guid></item><item><title><![CDATA[New comment by Smaug123 in "Formalizing Fermat's Last Theorem"]]></title><description><![CDATA[
<p>As I have said a few times now, you should read any first course in set theory. I’m quoting my third-year notes from Cambridge there, but essentially every intro to set theory will say the same. (I’m sure someone will find a single counterexample that does it somehow differently.)</p>
]]></description><pubDate>Sat, 05 Sep 2026 16:48:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=49578316</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49578316</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49578316</guid></item><item><title><![CDATA[New comment by Smaug123 in "Formalizing Fermat's Last Theorem"]]></title><description><![CDATA[
<p>You don’t necessarily want concision for that. You want “the right abstractions”, with an API that admits nice general work building on top of it. That might mean doing things in more generality than you wanted to. For example, for a long time (and possibly even now, I’m not up to date) there was very little graph theory in mathlib because there wasn’t consensus about what “the right definition” of a graph was, to permit all the possible consumers to get what they need from the API.</p>
]]></description><pubDate>Sat, 05 Sep 2026 12:34:04 +0000</pubDate><link>https://news.ycombinator.com/item?id=49575927</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49575927</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49575927</guid></item><item><title><![CDATA[New comment by Smaug123 in "Formalizing Fermat's Last Theorem"]]></title><description><![CDATA[
<p>The LLM is not the thing applying the logical rules. That is instead the deterministic system Lean 4. (Also that Apple paper was garbage even when it was written, assuming you’re referring to The Illusion of Thinking, and LLMs have got much better since.)</p>
]]></description><pubDate>Sat, 05 Sep 2026 12:29:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=49575904</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49575904</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49575904</guid></item><item><title><![CDATA[New comment by Smaug123 in "Formalizing Fermat's Last Theorem"]]></title><description><![CDATA[
<p>Fortunately FLT is an <i>extremely</i> simple statement. Much easier to satisfy yourself that its statement is what you wanted to say than it would be for most statements of interest!</p>
]]></description><pubDate>Sat, 05 Sep 2026 12:26:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=49575880</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49575880</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49575880</guid></item><item><title><![CDATA[New comment by Smaug123 in "Formalizing Fermat's Last Theorem"]]></title><description><![CDATA[
<p>Claude’s formalisation, being in Lean, is based on the calculus of inductive constructions, not ZFC. In Lean 3, per Carneiro, any theorem of Lean 3’s theory can be proved in ZFC plus some finite number of inaccessible cardinals (and, IIRC, vice versa). The precise strength of Lean 4 is not quite clear yet, I think (I guess this is partly what Lean4Lean is hoping to address).</p>
]]></description><pubDate>Sat, 05 Sep 2026 08:49:17 +0000</pubDate><link>https://news.ycombinator.com/item?id=49574592</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49574592</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49574592</guid></item></channel></rss>