<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: toth</title><link>https://news.ycombinator.com/user?id=toth</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Mon, 06 Apr 2026 08:45:30 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=toth" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[Drone Flyover of Project Stargate Datacenter by Citrini Research]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.citriniresearch.com/p/stargate-a-citrini-field-trip">https://www.citriniresearch.com/p/stargate-a-citrini-field-trip</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=45533489">https://news.ycombinator.com/item?id=45533489</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Thu, 09 Oct 2025 21:52:30 +0000</pubDate><link>https://www.citriniresearch.com/p/stargate-a-citrini-field-trip</link><dc:creator>toth</dc:creator><comments>https://news.ycombinator.com/item?id=45533489</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45533489</guid></item><item><title><![CDATA[New comment by toth in "From Rust to reality: The hidden journey of fetch_max"]]></title><description><![CDATA[
<p>Maybe we are just quibbling over semantics but the compiler intrinsic here is '__builtin_popcount'. 'stdc_count_ones' is a standard library element that presumably will be implemented using the intrinsic.<p>And FWIW all major C/C++ have for a long time have had a an intrinsic for this. In clang it even has the same name, Visual Studio it's something like just '_popcount'. So it has long been easy to roll your own macro that works everywhere.</p>
]]></description><pubDate>Wed, 24 Sep 2025 14:06:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=45360609</link><dc:creator>toth</dc:creator><comments>https://news.ycombinator.com/item?id=45360609</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45360609</guid></item><item><title><![CDATA[New comment by toth in "From Rust to reality: The hidden journey of fetch_max"]]></title><description><![CDATA[
<p>> An example you'll see in say a modern C compiler is that if you write the obvious loop to calculate how many bits are set in an int, the actual machine code on a brand new CPU should be a single population count instruction, C provides neither intrinsics (like Rust) not a dedicated "popcount" feature, so you can't write that but it's obviously what you want here and yup an optimising C compiler will do that.<p>C compilers definitely have intrinsics for this, for GCC for instance it is `__builtin_popcount`.<p>And apparently it has even standard language support for it since C23, it's  `stdc_count_ones` [1] and in  C++ you have `std::popcount` [2]<p>[1] <a href="https://en.cppreference.com/w/c/numeric/bit_manip.html" rel="nofollow">https://en.cppreference.com/w/c/numeric/bit_manip.html</a>
[2] <a href="https://en.cppreference.com/w/cpp/numeric/popcount.html" rel="nofollow">https://en.cppreference.com/w/cpp/numeric/popcount.html</a></p>
]]></description><pubDate>Wed, 24 Sep 2025 10:38:57 +0000</pubDate><link>https://news.ycombinator.com/item?id=45358537</link><dc:creator>toth</dc:creator><comments>https://news.ycombinator.com/item?id=45358537</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45358537</guid></item><item><title><![CDATA[New comment by toth in "A staff engineer's journey with Claude Code"]]></title><description><![CDATA[
<p>I think you shared the wrong link. Based on a quick youtube search I think you meant this one<p><a href="https://youtu.be/EL7Au1tzNxE" rel="nofollow">https://youtu.be/EL7Au1tzNxE</a></p>
]]></description><pubDate>Wed, 03 Sep 2025 10:18:29 +0000</pubDate><link>https://news.ycombinator.com/item?id=45114099</link><dc:creator>toth</dc:creator><comments>https://news.ycombinator.com/item?id=45114099</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45114099</guid></item><item><title><![CDATA[New comment by toth in "I don't like NumPy"]]></title><description><![CDATA[
<p>For pytorch the analogue is Named Tensors, but it's a provisional feature and not supported everywhere.<p><a href="https://docs.pytorch.org/docs/stable/named_tensor.html" rel="nofollow">https://docs.pytorch.org/docs/stable/named_tensor.html</a></p>
]]></description><pubDate>Thu, 15 May 2025 20:25:19 +0000</pubDate><link>https://news.ycombinator.com/item?id=43998955</link><dc:creator>toth</dc:creator><comments>https://news.ycombinator.com/item?id=43998955</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43998955</guid></item><item><title><![CDATA[New comment by toth in "The Buenos Aires Constant"]]></title><description><![CDATA[
<p>That seems uncharitable. I for one enjoy the tidbits he posts in is blog.</p>
]]></description><pubDate>Fri, 21 Feb 2025 10:27:22 +0000</pubDate><link>https://news.ycombinator.com/item?id=43125985</link><dc:creator>toth</dc:creator><comments>https://news.ycombinator.com/item?id=43125985</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43125985</guid></item><item><title><![CDATA[New comment by toth in "The Buenos Aires Constant"]]></title><description><![CDATA[
<p>> In a different world, we settled on a system of notation based on continued
> fractions rather than decimals for writing non-integers. In this world, nobody
> marvels at the irregularity of pi or e, the fact that they seem to go on for
> ever without a pattern - both numbers have elegant and regular representations > as infinite sums of fractions.<p>There are some less widely-known topics in math that seem to make some of those that learn them want to "evangelize" about them and wish they had a more starring role. Continued fractions are one.<p>Now, don't get me wrong. Continued fractions are very cool, some of the associated results are very beautiful. More people should know about them. But they never will be a viable alternative to decimals. Computation is too hard with them for one.<p>Also, while <i>e</i> has a nice regular continued fraction expansion [1], that is not the case for <i>pi</i> [2]. There is no known formula for the terms, they are as irregular as the decimal digits. There <i>are</i> nice simple formulas for <i>pi</i> as <i>infinite sums of fractions</i> (simplest is probably [3]) but those are <i>not</i> continued fractions.<p>[1] <a href="https://oeis.org/A003417" rel="nofollow">https://oeis.org/A003417</a>
[2] <a href="https://oeis.org/A001203" rel="nofollow">https://oeis.org/A001203</a>
[3] <a href="https://en.wikipedia.org/wiki/Leibniz_formula_for_%CF%80" rel="nofollow">https://en.wikipedia.org/wiki/Leibniz_formula_for_%CF%80</a></p>
]]></description><pubDate>Fri, 21 Feb 2025 10:26:17 +0000</pubDate><link>https://news.ycombinator.com/item?id=43125978</link><dc:creator>toth</dc:creator><comments>https://news.ycombinator.com/item?id=43125978</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43125978</guid></item><item><title><![CDATA[New comment by toth in "21st Century C++"]]></title><description><![CDATA[
<p>Well, actually... the "main" function is handled specially in the standard. It is the only one where the return type is not void and you don't need to explicitly return from it - if you do it, it is treated as if you returned 0.
(You will most definitely get a compiler error if you try this with any other function.)<p>You might say this is very silly, and you'd be right. But as quirks of C++ go it is one of the most benign ones. As usual it is there for backwards compatibility.<p>And, for what it's worth, the uber-bean counter didn't miss a bean here...</p>
]]></description><pubDate>Sun, 09 Feb 2025 17:13:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=42991940</link><dc:creator>toth</dc:creator><comments>https://news.ycombinator.com/item?id=42991940</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42991940</guid></item><item><title><![CDATA[New comment by toth in "Promising results from DeepSeek R1 for code"]]></title><description><![CDATA[
<p>Those points are true of <i>current</i> AI models, but how sure are you they will remain true as technology evolves?<p>Maybe you believe that they will always stay true, that there's some ineffable human quality that will never be captured by AI and value creation will always be bottle-necked by humans. That would be nice.<p>But even if you still need humans in the loop, it's not clear how "democratizing" this would be. It might sound great if in a few years you and everyone else can run an AI on their laptop that is as a good as a great technical co-founder that never sleeps. But note that means that someone who owns a data-center can run the equivalent of the current entire technical staff of Google, Meta, and OpenAI combined. Doesn't sound like a very level playing field.</p>
]]></description><pubDate>Wed, 29 Jan 2025 10:15:48 +0000</pubDate><link>https://news.ycombinator.com/item?id=42863380</link><dc:creator>toth</dc:creator><comments>https://news.ycombinator.com/item?id=42863380</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42863380</guid></item><item><title><![CDATA[New comment by toth in "Promising results from DeepSeek R1 for code"]]></title><description><![CDATA[
<p>I can't understand how you reach your conclusion.<p>At present, if you have financial capital and need intellectual capital you need to find people willing to work for you and pay them a lot of money. With enough progress in AI you can get the intellectual capital from machines instead, for a lot less. What loses value is human intellectual capital. Financial capital just gained a lot of power, it can now substitute for intellectual capital.<p>Sure, you could pretend this means you'll be able to launch a startup without any employees, and so will everyone. But why wouldn't Sam Altman or whomever just start AI Ycombinator with hundreds of thousands of AI "founders"? Do you really think it would be more "democratic"?</p>
]]></description><pubDate>Tue, 28 Jan 2025 19:07:40 +0000</pubDate><link>https://news.ycombinator.com/item?id=42856527</link><dc:creator>toth</dc:creator><comments>https://news.ycombinator.com/item?id=42856527</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42856527</guid></item><item><title><![CDATA[New comment by toth in "Rational or not? This basic math question took decades to answer"]]></title><description><![CDATA[
<p>Actually `e^(sqrt(n) pi)` is very close to being an integer for a couple of different `n`s, including 67 and 163. For 163 it's much closer to an integer, but for 67 you get something you can easily check in double precision floats is close to an integer, so I thought it worked better as a joke answer :)<p>FYI, the reason you get these almost integers is related to the `n`s being Heegner numbers, see <a href="https://en.wikipedia.org/wiki/Heegner_number" rel="nofollow">https://en.wikipedia.org/wiki/Heegner_number</a>.</p>
]]></description><pubDate>Fri, 10 Jan 2025 09:31:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=42654102</link><dc:creator>toth</dc:creator><comments>https://news.ycombinator.com/item?id=42654102</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42654102</guid></item><item><title><![CDATA[New comment by toth in "Rational or not? This basic math question took decades to answer"]]></title><description><![CDATA[
<p>Charitably it was a joke, as was my quip about `e^(sqrt(67) pi)`. It is a funnier joke without a disclaimer at the end, but unlike GP I couldn't bring myself to leave one out and potentially mislead some people...<p>What I meant was that I didn't know that `e^pi - pi` is another transcendental expression that is very close an integer. You might think this is just an uninteresting coincidence but there's some interesting mathematics around such "almost integers". Wikipedia has a quick overview [1]. I didn't realize it before, but they have GP's example and also the awesome `e + pi + e pi + e^pi + pi^e ~= 60`.<p>[1] <a href="https://en.wikipedia.org/wiki/Almost_integer" rel="nofollow">https://en.wikipedia.org/wiki/Almost_integer</a></p>
]]></description><pubDate>Fri, 10 Jan 2025 09:25:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=42654067</link><dc:creator>toth</dc:creator><comments>https://news.ycombinator.com/item?id=42654067</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42654067</guid></item><item><title><![CDATA[New comment by toth in "Rational or not? This basic math question took decades to answer"]]></title><description><![CDATA[
<p>Very nice, didn't know about that one!<p>In a similar vein, Ramanujan famously proved that e^(sqrt(67) pi) is an integer.<p>And obviously exp(i pi) is an integer as well, but that's less fun.<p>(Note: only one of the above claims is correct)</p>
]]></description><pubDate>Thu, 09 Jan 2025 21:33:13 +0000</pubDate><link>https://news.ycombinator.com/item?id=42650000</link><dc:creator>toth</dc:creator><comments>https://news.ycombinator.com/item?id=42650000</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42650000</guid></item><item><title><![CDATA[New comment by toth in "The Impossibility of Supersized Machines (2017)"]]></title><description><![CDATA[
<p>> Are you just being overawed by IQ tests, which are notorious for measuring only ability to pass IQ tests?<p>People like to say things like this, but nothing could be further than the truth. There is a vast literature showing that IQ predicts things like job performance, school performance, income and wealth [1]. IQ is highly persistent across time for fixed individuals. Yes, "intelligence" is not a precisely defined concept, but that doesn't mean that it isn't real. A lot of useful concepts have some vagueness about, even "height" to take the example parodied in the OP.<p>And "super intelligence" is admittedly even vaguer, it just means sufficiently smarter than humans. If you do have a problem with that presentation just think of specific capabilities a "super intelligence" would be expected to have. For instance, the ability to attain super-human performance in a game (e.g., chess or go) that it had never seen before. The ability to produce fully functional highly complex software from a natural language spec in instants. The ability to outperform any human at any white-collar job without being specifically trained for it.<p>Are you confident that a machine with all those capabilities are impossible?<p>[1] <a href="https://en.wikipedia.org/wiki/Intelligence_quotient#Social_correlations" rel="nofollow">https://en.wikipedia.org/wiki/Intelligence_quotient#Social_c...</a></p>
]]></description><pubDate>Sat, 15 Jun 2024 15:28:23 +0000</pubDate><link>https://news.ycombinator.com/item?id=40690361</link><dc:creator>toth</dc:creator><comments>https://news.ycombinator.com/item?id=40690361</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40690361</guid></item><item><title><![CDATA[New comment by toth in "Understanding Stein's Paradox (2021)"]]></title><description><![CDATA[
<p>Right, it's a limit at infinity</p>
]]></description><pubDate>Sun, 05 May 2024 20:41:58 +0000</pubDate><link>https://news.ycombinator.com/item?id=40268150</link><dc:creator>toth</dc:creator><comments>https://news.ycombinator.com/item?id=40268150</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40268150</guid></item><item><title><![CDATA[New comment by toth in "Understanding Stein's Paradox (2021)"]]></title><description><![CDATA[
<p>You make a valid point, but I feel there is something in the direction the article is gesturing at...<p>The mean of the n-dimensional gaussian is an element of R^n, an unbounded space. There's no uninformed prior over this space, so there is always a choice of origin implicit in some way...<p>As you say, you can shrink towards any point and you get a valid James-Steiner estimator that is strictly better than the naive estimator. But if you send the point you are shrinking towards to infinity you get the naive estimator again. So it feels like the fact you are implicitly selecting a finite chunk of R^n around an origin plays a role in the paradox...</p>
]]></description><pubDate>Sun, 05 May 2024 19:45:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=40267596</link><dc:creator>toth</dc:creator><comments>https://news.ycombinator.com/item?id=40267596</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40267596</guid></item><item><title><![CDATA[New comment by toth in "Understanding Stein's Paradox (2021)"]]></title><description><![CDATA[
<p>Ditto.<p>I think that ship has sailed, but I think it's unfortunate that "ReLU(x)" became a popular notation for "max(0,x)".
And using the name "rectified linear unit" for basically "positive part" seems like a parody, like insisting on calling water "dihydrogen monoxide".</p>
]]></description><pubDate>Sun, 05 May 2024 19:34:58 +0000</pubDate><link>https://news.ycombinator.com/item?id=40267512</link><dc:creator>toth</dc:creator><comments>https://news.ycombinator.com/item?id=40267512</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40267512</guid></item><item><title><![CDATA[New comment by toth in "How ECMO is redefining death"]]></title><description><![CDATA[
<p>To me it sounded like part of the problem is that people on ECMO cannot leave  the ICU because at any moment they might have a complication that requires immediate emergency care.<p>So it's not enough to make them smaller and cheaper, they also have to be made much less prone to these complications. I am sure that will happen in time, but I am also sure we'll be able to grow people new lungs in time</p>
]]></description><pubDate>Tue, 30 Apr 2024 20:36:19 +0000</pubDate><link>https://news.ycombinator.com/item?id=40215999</link><dc:creator>toth</dc:creator><comments>https://news.ycombinator.com/item?id=40215999</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40215999</guid></item><item><title><![CDATA[New comment by toth in "Claude 3 surpasses GPT-4 on Chatbot Arena for the first time"]]></title><description><![CDATA[
<p>Is github copilot using GPT-4 or 3.5? I've tried to find out for sure but I can't seem to find the information anywhere</p>
]]></description><pubDate>Wed, 27 Mar 2024 17:21:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=39841971</link><dc:creator>toth</dc:creator><comments>https://news.ycombinator.com/item?id=39841971</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39841971</guid></item><item><title><![CDATA[New comment by toth in "Gnuplotlib: A gnuplot-based plotting backend for NumPy"]]></title><description><![CDATA[
<p>I think matplotlib's main strength is its breadth and power. It really lets you do exactly what you want if you spend enough time fiddling and digging through the documentation.<p>All this versatility comes at the expense of ease of use. It could certainly do a better job of making the simple common use cases more straightforward.<p>gnuplot arguably has similar power and versatility and it does make the simple stuff easier.<p>One thing that matplotlib is IMO bad at is interactive plots. They are very slow, and the controls are not intuitive. 99% of the time you just want to zoom and pan and those should be default actions.<p>gnuplotlib looks interesting and I will have a look, but these days most of the plots I do are in jupyter notebooks and I really want inline interactive plots so I don't think I will use it much. FWIW, what I use currently is plotly -   the interactivity is very good (way better than matplotlib's) and plotly.express is very easy to use for the simple use cases.</p>
]]></description><pubDate>Thu, 01 Feb 2024 10:29:22 +0000</pubDate><link>https://news.ycombinator.com/item?id=39214491</link><dc:creator>toth</dc:creator><comments>https://news.ycombinator.com/item?id=39214491</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39214491</guid></item></channel></rss>