<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: pierrebai</title><link>https://news.ycombinator.com/user?id=pierrebai</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Sat, 25 Apr 2026 21:41:36 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=pierrebai" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by pierrebai in "Rossi's Revenge"]]></title><description><![CDATA[
<p>Strawman detection activated.<p>The goal of giving money is not to make those who receive it more educated, better parents or making them politically active. I mean, why did I have to say that?<p>(The amount of money is also unlikely to enbale to make savings for the future.)<p>The goal is that their immediate poverty decreases. Why is the author insistent on the measurement of unrelated stats? Because he has an ax to grind.</p>
]]></description><pubDate>Wed, 20 Aug 2025 19:02:15 +0000</pubDate><link>https://news.ycombinator.com/item?id=44965106</link><dc:creator>pierrebai</dc:creator><comments>https://news.ycombinator.com/item?id=44965106</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44965106</guid></item><item><title><![CDATA[New comment by pierrebai in "Without the futex, it's futile"]]></title><description><![CDATA[
<p>OTOH, 99% of use cases don't care about performance and just want a portable implementation.<p>While it could be useful to have a "fast" variation that offers no guarantee at all, what you would end up with (because people are vain) is that too may people would use those instead "because perf", even though the actual usage is not performance critical,  and have code that breaks whenever the compiler or platform changes.</p>
]]></description><pubDate>Wed, 20 Aug 2025 13:48:37 +0000</pubDate><link>https://news.ycombinator.com/item?id=44961929</link><dc:creator>pierrebai</dc:creator><comments>https://news.ycombinator.com/item?id=44961929</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44961929</guid></item><item><title><![CDATA[New comment by pierrebai in "Show HN: Jumping Julia Maze"]]></title><description><![CDATA[
<p>Knowing that a typical maze will have branching paths at the beginning, but necessarily one good path at the end, I find it easier to start from the goal and work my way backward.</p>
]]></description><pubDate>Wed, 27 Nov 2024 16:27:12 +0000</pubDate><link>https://news.ycombinator.com/item?id=42257277</link><dc:creator>pierrebai</dc:creator><comments>https://news.ycombinator.com/item?id=42257277</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42257277</guid></item><item><title><![CDATA[New comment by pierrebai in "Saturated fat: the making and unmaking of a scientific consensus (2022)"]]></title><description><![CDATA[
<p>But your example is not reflective of the study. Are you saying that the 17% reduction is for some reason significant but the other ones, all of which would inconveniently disagree with the result you want, are not, even though they are in the same study?<p>IOW, you're saying that among the study results, all that agree with your POV are valid, all that don't are invalid. That's quite some bias there.</p>
]]></description><pubDate>Sun, 27 Oct 2024 18:15:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=41964446</link><dc:creator>pierrebai</dc:creator><comments>https://news.ycombinator.com/item?id=41964446</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41964446</guid></item><item><title><![CDATA[New comment by pierrebai in "Saturated fat: the making and unmaking of a scientific consensus (2022)"]]></title><description><![CDATA[
<p>Well, we read the article, which cites many studies. Maybe she is doing a super selective review of the field, but she does not merely quote one study, but several, all of which indicate that there is no correlation between saturated fat and cardiovascular problems.<p>IOW, we did not merely "read and trusted one random article" but assessed the presented evidence. You OTOH, merely provided ad-hominem attack on both the author and anyone who dared believe the presented evidence, which smacks of trying to shame people in not voicing their opinion.</p>
]]></description><pubDate>Sun, 27 Oct 2024 18:05:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=41964369</link><dc:creator>pierrebai</dc:creator><comments>https://news.ycombinator.com/item?id=41964369</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41964369</guid></item><item><title><![CDATA[New comment by pierrebai in "Advice on Reading Homer in Translation"]]></title><description><![CDATA[
<p>Ah, the old "if you do not spent your time, effort an interest where <i>I</i> have chosen to spend them, then you are an inferior human being to me."<p>Everyone judges people who do less about subject X, Y, Z to be criminal, lazy slob, and everyone doing more to be inflexible annoying zealots.<p>Woe those who are not me and do things differently, for they are worthless.</p>
]]></description><pubDate>Tue, 17 Sep 2024 18:11:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=41570811</link><dc:creator>pierrebai</dc:creator><comments>https://news.ycombinator.com/item?id=41570811</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41570811</guid></item><item><title><![CDATA[New comment by pierrebai in "How the Hourglass Won"]]></title><description><![CDATA[
<p>Isn't this whole description a lie, both ways?<p>You can embed/tunnel any network transport into another. There is nothing magical about the internet and IP. It is actually being tunneled when you're using a cable modem. WiFi is a horrible hack that encapsulate IP in a very ugly way to make it onto it's wireless tech.<p>You could have tunnel ATM over IP, I'm pretty sure of it. The depiction seems to me like a flattering extolment of IP.</p>
]]></description><pubDate>Thu, 05 Sep 2024 21:17:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=41460486</link><dc:creator>pierrebai</dc:creator><comments>https://news.ycombinator.com/item?id=41460486</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41460486</guid></item><item><title><![CDATA[New comment by pierrebai in "Crafting formulas: Lambdas all the way down"]]></title><description><![CDATA[
<p>No, since they use an integer (Z) as the denominator. So their representation support having -1 (i.e 0) as the denominator.</p>
]]></description><pubDate>Tue, 06 Aug 2024 15:59:09 +0000</pubDate><link>https://news.ycombinator.com/item?id=41172130</link><dc:creator>pierrebai</dc:creator><comments>https://news.ycombinator.com/item?id=41172130</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41172130</guid></item><item><title><![CDATA[New comment by pierrebai in "Crafting formulas: Lambdas all the way down"]]></title><description><![CDATA[
<p>I wonder why they chose to represent rationals with subtracting one from the denominator. It makes human parsing of the value harder and in many case makes the implementation code slighter harder; for example the equality op need to increment both denominators before using them. I suspect such increment must be constantly be needed left and right?</p>
]]></description><pubDate>Tue, 06 Aug 2024 15:13:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=41171664</link><dc:creator>pierrebai</dc:creator><comments>https://news.ycombinator.com/item?id=41171664</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41171664</guid></item><item><title><![CDATA[New comment by pierrebai in "Types as Interfaces"]]></title><description><![CDATA[
<p>Some of the ideas in the blog must be speculative, given that it fell through a wormhole, being published September 17, 2024.</p>
]]></description><pubDate>Tue, 23 Jul 2024 17:01:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=41048328</link><dc:creator>pierrebai</dc:creator><comments>https://news.ycombinator.com/item?id=41048328</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41048328</guid></item><item><title><![CDATA[New comment by pierrebai in "Children's mental models of recursive LOGO programs (1985)"]]></title><description><![CDATA[
<p>... or simply that the LOGO language syntax and choice of commands is confusing? Without formal explanation, how surprising is it really that a child would assume that STOP mean stop?<p>I'd bet that if LOGO had used RETURN, like many other languages, then the children's reasoning would be likely be more accurate. Or go the other way and make them tell you what this or that brainfuck[1] program does. So, to me, this research says more about LOGO choices than anything.<p>[1] <a href="https://esolangs.org/wiki/Brainfuck" rel="nofollow">https://esolangs.org/wiki/Brainfuck</a></p>
]]></description><pubDate>Fri, 12 Jul 2024 02:17:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=40942264</link><dc:creator>pierrebai</dc:creator><comments>https://news.ycombinator.com/item?id=40942264</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40942264</guid></item><item><title><![CDATA[New comment by pierrebai in "Sljit: Platform independent low-level JIT compiler"]]></title><description><![CDATA[
<p>Looking at the code, "maintainability" is quite relative: it might be maintainable by the original author, but the code has no comment and is chuck-full of magic constants without any explanations. Or'ing this hex value, and'ing that other hex value, etc.</p>
]]></description><pubDate>Tue, 09 Jul 2024 19:53:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=40920339</link><dc:creator>pierrebai</dc:creator><comments>https://news.ycombinator.com/item?id=40920339</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40920339</guid></item><item><title><![CDATA[New comment by pierrebai in "I have no constructor, and I must initialize"]]></title><description><![CDATA[
<p>The article is just plain wrong about classes: if you have declared any constructor, then the language will <i>not</i> provide a default constructor and default-initialization will fail with a compiler diagnostic.<p>So their claim that "T t;" will "do nothing" is incorrect.<p><pre><code>    class T
    {
    public:
        T(int);
    };
    T t;
</code></pre>
Will fail.</p>
]]></description><pubDate>Fri, 05 Jul 2024 19:30:37 +0000</pubDate><link>https://news.ycombinator.com/item?id=40885337</link><dc:creator>pierrebai</dc:creator><comments>https://news.ycombinator.com/item?id=40885337</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40885337</guid></item><item><title><![CDATA[New comment by pierrebai in "Dear Julia, Dear Yuri: A mathematical correspondence (2022)"]]></title><description><![CDATA[
<p>I'm utterly confused by the description of the solution of Hilbert's 10th problem.<p>On one hand, the article claims that Diophantine equations are polynomials. On the other hand, it claims that when JR is true, a Diophantine equations grows faster than a polynomial.<p>How can a polynomial grow faster than polynomial? That seems like a contradiction to me.</p>
]]></description><pubDate>Wed, 03 Jul 2024 15:44:40 +0000</pubDate><link>https://news.ycombinator.com/item?id=40867095</link><dc:creator>pierrebai</dc:creator><comments>https://news.ycombinator.com/item?id=40867095</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40867095</guid></item><item><title><![CDATA[New comment by pierrebai in "Kaprekar's Magic 6174"]]></title><description><![CDATA[
<p>Interestingly, there is a common pattern for fixed-points and cycles for different number lengths: numbers made of 4, 5 and 9. For example<p>length 3: fixed-point 495
length 5: 2-cycle containing 59994
length 6: fixed-point 59994<p>Similarly for digits 6, 1, 4, 7:<p>length 4: 6174
length 5: 4-cycle containing 61974
length 6: fixed-point 631764</p>
]]></description><pubDate>Fri, 14 Jun 2024 20:29:31 +0000</pubDate><link>https://news.ycombinator.com/item?id=40684792</link><dc:creator>pierrebai</dc:creator><comments>https://news.ycombinator.com/item?id=40684792</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40684792</guid></item><item><title><![CDATA[New comment by pierrebai in "Forsp: A Forth+Lisp Hybrid Lambda Calculus Language"]]></title><description><![CDATA[
<p>Reading the example, I really wish the syntax for push and pop had been "<foo" (push foo on stack) and ">bar" (pop from stack into bar). I find the choice of $ and ^ not obvious. Especially since, for me, ^ implies popping, not pushing.</p>
]]></description><pubDate>Tue, 11 Jun 2024 20:07:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=40650871</link><dc:creator>pierrebai</dc:creator><comments>https://news.ycombinator.com/item?id=40650871</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40650871</guid></item><item><title><![CDATA[New comment by pierrebai in "I got tired of hearing that YC fired Sam, so here's what actually happened"]]></title><description><![CDATA[
<p>Was it firing was it not? It's all semantics, people on both sides of the fence have legitimate reasons to choose one over the other. Get over it.<p>The real interesting bit, is that Paul Graham somehow thought it was worthwhile to stick his neck out and improve Sam Altman public image by clarifying he was ever fired from YC.</p>
]]></description><pubDate>Thu, 30 May 2024 17:46:50 +0000</pubDate><link>https://news.ycombinator.com/item?id=40526555</link><dc:creator>pierrebai</dc:creator><comments>https://news.ycombinator.com/item?id=40526555</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40526555</guid></item><item><title><![CDATA[New comment by pierrebai in "Computer scientists invent an efficient new way to count"]]></title><description><![CDATA[
<p>IDK, if my explanation is correct, but I do believe it is. I t goes as follow.<p>Imagine that you have a container of potential limitless capacity. The container starts with smalls capacity, equal to the real limited capacity that the real algorithm uses. As you add elements, when the container is full, its capacity is doubled, but all elements are then placed in a random position.<p>When you're done, you're told the occupancy of the subset of the large container corresponding to the initial size and how many times the container size was doubled. Multiplying that occupancy by the power of two of the number of doubling gives you an approximation of the real size.<p>The small catch is that in the actual algorithm, due to the discarding, the final number of elements, the occupancy, is somewhat erroneous.<p>EDIT<p>Another way to say this: you got a container of limited capacity S. When full, you "virtually" double its size and then randomly move elements over the full "imaginary" size of the virtual container. So after the first filling, you end up with about 1/2 the elements. After the second filling 1/4, etc. Also, since now your "virtual" container is larger, when you add a new element, there is only 1/2^n the it will be place inside your limited-capacity view of the entire virtual container.<p>At the end, the approximate real count is the number of elements you got multiplied by 2 to the power of the number of size doubling.<p>Again, it is as if you have a small window into a limitless container.</p>
]]></description><pubDate>Fri, 17 May 2024 18:53:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=40393097</link><dc:creator>pierrebai</dc:creator><comments>https://news.ycombinator.com/item?id=40393097</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40393097</guid></item><item><title><![CDATA[New comment by pierrebai in "I was at the clapperboard for Orson Welles' drunk wine commercial (2021)"]]></title><description><![CDATA[
<p>I have a hard time swallowing the hubris of the teller. No one was to be able to approach or chat with Orson Wells... except him, of course, who "connected" with Orson, so it was all OK and he'd launch with Orson too! But the others, these inferiors, mere crew, set extras. God, even a clapper boy could not /possibly/ do their job as they would need to get near Orson Wells!!!<p>But him, the director, yeah, he could approach talk, whatever. He's in another classssssssss, you see...</p>
]]></description><pubDate>Fri, 10 May 2024 15:14:40 +0000</pubDate><link>https://news.ycombinator.com/item?id=40320003</link><dc:creator>pierrebai</dc:creator><comments>https://news.ycombinator.com/item?id=40320003</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40320003</guid></item><item><title><![CDATA[New comment by pierrebai in "Temporal Python – A durable, distributed asyncio event loop (2023)"]]></title><description><![CDATA[
<p>Read the example code, have a sinking feeling that is not taken from a real tested example. Either there are multiple unexplained symbols or teh code does not actually run.<p>For example, in "Implementing a Workflow" the execute_activity refers to  Purchaser.purchase, which is not declared anywhere.<p>If the execute_activity times-out after 1 minutes, the status does not seem to be updated anywhere.<p>In "Running a Worker", do_purchaser is passed as an activity, without explanation. (I guess I'd need to read the fundamental Temporal docs?)</p>
]]></description><pubDate>Thu, 09 May 2024 15:11:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=40309034</link><dc:creator>pierrebai</dc:creator><comments>https://news.ycombinator.com/item?id=40309034</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40309034</guid></item></channel></rss>