<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: davidgrenier</title><link>https://news.ycombinator.com/user?id=davidgrenier</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Fri, 05 Jun 2026 00:18:40 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=davidgrenier" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by davidgrenier in "After dissing Anthropic for limiting Mythos, OpenAI restricts access to Cyber"]]></title><description><![CDATA[
<p>Yeah I guess two companies who would otherwise be considered going for bankruptcy have models too expensive to run. As they don't see themselves making money any time soon, they have to turn every future model into a weird fascination.</p>
]]></description><pubDate>Fri, 01 May 2026 10:49:49 +0000</pubDate><link>https://news.ycombinator.com/item?id=47973232</link><dc:creator>davidgrenier</dc:creator><comments>https://news.ycombinator.com/item?id=47973232</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47973232</guid></item><item><title><![CDATA[New comment by davidgrenier in "Finding all regex matches has always been O(n²)"]]></title><description><![CDATA[
<p>I wonder how gracefully redgrep handles this. This tool hasn't been talked about since the year of its release. If I recall correctly, it doesn't handle some obstruse regexes the way conventional tools do however.<p><a href="https://github.com/google/redgrep" rel="nofollow">https://github.com/google/redgrep</a></p>
]]></description><pubDate>Tue, 24 Mar 2026 11:17:04 +0000</pubDate><link>https://news.ycombinator.com/item?id=47501014</link><dc:creator>davidgrenier</dc:creator><comments>https://news.ycombinator.com/item?id=47501014</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47501014</guid></item><item><title><![CDATA[New comment by davidgrenier in "Trump's attacks on universities get darker, with shadows reaching our shores"]]></title><description><![CDATA[
<p>There's only one "other side" in this, it's the American people.</p>
]]></description><pubDate>Sat, 29 Mar 2025 11:46:19 +0000</pubDate><link>https://news.ycombinator.com/item?id=43514724</link><dc:creator>davidgrenier</dc:creator><comments>https://news.ycombinator.com/item?id=43514724</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43514724</guid></item><item><title><![CDATA[New comment by davidgrenier in "Canon wants us to pay for using our own camera as a webcam"]]></title><description><![CDATA[
<p>v4l2-ctl on linux allows me to change such settings on a global level, maybe that might work if a version can be found on his OS.</p>
]]></description><pubDate>Fri, 17 Jan 2025 11:58:37 +0000</pubDate><link>https://news.ycombinator.com/item?id=42736641</link><dc:creator>davidgrenier</dc:creator><comments>https://news.ycombinator.com/item?id=42736641</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42736641</guid></item><item><title><![CDATA[New comment by davidgrenier in "It's time to abandon the cargo cult metaphor"]]></title><description><![CDATA[
<p>I think the author is generous in granting that Caro-Cult programming works.</p>
]]></description><pubDate>Mon, 13 Jan 2025 12:04:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=42682576</link><dc:creator>davidgrenier</dc:creator><comments>https://news.ycombinator.com/item?id=42682576</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42682576</guid></item><item><title><![CDATA[New comment by davidgrenier in "“A Course of Pure Mathematics” – G. H. Hardy (1921) [pdf]"]]></title><description><![CDATA[
<p>I haven't looked at Hardy's but the presentation in Spivak is also Dedekind cuts. Perhaps Hardy uses a different approach and OP misnamed it? Rudin's chapter 1 annex also use Dedekind's cuts.</p>
]]></description><pubDate>Tue, 31 Dec 2024 11:54:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=42558181</link><dc:creator>davidgrenier</dc:creator><comments>https://news.ycombinator.com/item?id=42558181</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42558181</guid></item><item><title><![CDATA[New comment by davidgrenier in "“A Course of Pure Mathematics” – G. H. Hardy (1921) [pdf]"]]></title><description><![CDATA[
<p>Where we define the real numbers as the least upper bounds of special sets. There is a bijection between these sets and the set of real numbers which we commonly think of and that bijection is the least upper bound of such sets.</p>
]]></description><pubDate>Tue, 31 Dec 2024 11:48:00 +0000</pubDate><link>https://news.ycombinator.com/item?id=42558154</link><dc:creator>davidgrenier</dc:creator><comments>https://news.ycombinator.com/item?id=42558154</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42558154</guid></item><item><title><![CDATA[New comment by davidgrenier in "Formal methods: Just good engineering practice?"]]></title><description><![CDATA[
<p>Your very last example kinda supports the thesis up there, considering how it's been going.</p>
]]></description><pubDate>Mon, 24 Jun 2024 11:19:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=40774675</link><dc:creator>davidgrenier</dc:creator><comments>https://news.ycombinator.com/item?id=40774675</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40774675</guid></item><item><title><![CDATA[New comment by davidgrenier in "Researchers have found a faster way to do integer linear programming"]]></title><description><![CDATA[
<p>Correct me if I'm wrong but (log n)^O(n) sounds like atrocious complexity?</p>
]]></description><pubDate>Tue, 30 Jan 2024 12:13:46 +0000</pubDate><link>https://news.ycombinator.com/item?id=39189195</link><dc:creator>davidgrenier</dc:creator><comments>https://news.ycombinator.com/item?id=39189195</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39189195</guid></item><item><title><![CDATA[New comment by davidgrenier in "Researchers have found a faster way to do integer linear programming"]]></title><description><![CDATA[
<p>LP or ILP? There is a significant difference since for non-discrete problem Linear Programming is shockingly efficient and in no way can be considered a brute force technique.<p>edit: What would be a technique you consider non-brute force in discrete problems?</p>
]]></description><pubDate>Tue, 30 Jan 2024 12:07:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=39189145</link><dc:creator>davidgrenier</dc:creator><comments>https://news.ycombinator.com/item?id=39189145</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=39189145</guid></item><item><title><![CDATA[New comment by davidgrenier in "Conway's Game of Life is omniperiodic"]]></title><description><![CDATA[
<p>I was speculating two oscillators with periods p and q could be composed (as long as there was no way for them to interact) to create an oscillator of period p*q/gcd(p,q) but wondering why large primes wouldn't be a problem.<p>I guess this is my answer.</p>
]]></description><pubDate>Fri, 08 Dec 2023 12:18:07 +0000</pubDate><link>https://news.ycombinator.com/item?id=38568108</link><dc:creator>davidgrenier</dc:creator><comments>https://news.ycombinator.com/item?id=38568108</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=38568108</guid></item><item><title><![CDATA[New comment by davidgrenier in "Mathematical proof is a social compact"]]></title><description><![CDATA[
<p>I think his argument was restricted to a human-produced mathematical result being ported to a Lean program where one would be just as likely to commit a mistake. However I disagree as well, I recall the difficulty of expressing what I wanted to Coq being a barrier to expressing it incorrectly.</p>
]]></description><pubDate>Thu, 31 Aug 2023 17:51:03 +0000</pubDate><link>https://news.ycombinator.com/item?id=37341098</link><dc:creator>davidgrenier</dc:creator><comments>https://news.ycombinator.com/item?id=37341098</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=37341098</guid></item><item><title><![CDATA[New comment by davidgrenier in "Mathematical proof is a social compact"]]></title><description><![CDATA[
<p>Good teacher, his Number Theory book felt really good though I have no comparable in Number Theory. I must say Number Theory and Combinatorics are the most difficult topics I got acquainted with in undergrad.</p>
]]></description><pubDate>Thu, 31 Aug 2023 17:31:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=37340784</link><dc:creator>davidgrenier</dc:creator><comments>https://news.ycombinator.com/item?id=37340784</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=37340784</guid></item><item><title><![CDATA[New comment by davidgrenier in "Ask HN: What is the best desk chair for small spaces?"]]></title><description><![CDATA[
<p>Bouty makes excellent chair. Looking at their website I'm thinking Arista/Kadera/Fira. The model of chair I have doesn't seem front page but it is the Sity 9002.<p>The piston gave after 10+ years of service. Contacted them, warranty is for life, they had someone show up and replace it for free.</p>
]]></description><pubDate>Sun, 06 Aug 2023 13:29:04 +0000</pubDate><link>https://news.ycombinator.com/item?id=37021692</link><dc:creator>davidgrenier</dc:creator><comments>https://news.ycombinator.com/item?id=37021692</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=37021692</guid></item><item><title><![CDATA[New comment by davidgrenier in "F# RISC-V Instruction Set formal specification"]]></title><description><![CDATA[
<p>It isn't though: <a href="https://github.com/mrLSD/riscv-fs/blob/fa039b123ded9fa0c05d00e4854e4c721e8ec0dd/CLI.fs#L77">https://github.com/mrLSD/riscv-fs/blob/fa039b123ded9fa0c05d0...</a></p>
]]></description><pubDate>Sat, 29 Jul 2023 10:44:27 +0000</pubDate><link>https://news.ycombinator.com/item?id=36918866</link><dc:creator>davidgrenier</dc:creator><comments>https://news.ycombinator.com/item?id=36918866</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=36918866</guid></item><item><title><![CDATA[New comment by davidgrenier in "F# RISC-V Instruction Set formal specification"]]></title><description><![CDATA[
<p>I think this qualifies?<p><a href="https://en.wikipedia.org/wiki/MMIX#Simulators_and_assembler" rel="nofollow noreferrer">https://en.wikipedia.org/wiki/MMIX#Simulators_and_assembler</a></p>
]]></description><pubDate>Sat, 29 Jul 2023 10:40:15 +0000</pubDate><link>https://news.ycombinator.com/item?id=36918838</link><dc:creator>davidgrenier</dc:creator><comments>https://news.ycombinator.com/item?id=36918838</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=36918838</guid></item><item><title><![CDATA[New comment by davidgrenier in "F# RISC-V Instruction Set formal specification"]]></title><description><![CDATA[
<p>My understanding of this is that it is an emulator that is meant to be very clear to read.</p>
]]></description><pubDate>Sat, 29 Jul 2023 10:37:35 +0000</pubDate><link>https://news.ycombinator.com/item?id=36918813</link><dc:creator>davidgrenier</dc:creator><comments>https://news.ycombinator.com/item?id=36918813</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=36918813</guid></item><item><title><![CDATA[New comment by davidgrenier in "Mozilla should call for the removal of Google from W3C because of WEI"]]></title><description><![CDATA[
<p>Someone mentionned in the Mastodon thread that they have an Android phone with nothing-from-google on it. I speculate his installation is even more responsive than whatever default the product came with and I'd like to do that.<p>I have a terrible Vankyo Z1 table that is very slow. Where do I start?</p>
]]></description><pubDate>Fri, 28 Jul 2023 10:48:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=36905092</link><dc:creator>davidgrenier</dc:creator><comments>https://news.ycombinator.com/item?id=36905092</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=36905092</guid></item><item><title><![CDATA[New comment by davidgrenier in "Threads and Goroutines"]]></title><description><![CDATA[
<p>Note that lightweight threads (even in CSP style concurrency model) can be even lighter and faster. F#'s Hopac library seems to meet such expectations with this simple program:<p><pre><code>   #r "nuget:hopac"

   open Hopac
   open Hopac.Infixes
   open Hopac.Extensions

   seq{1..1000000}
   |> Seq.Con.iterJobIgnore (fun _ -> timeOutMillis 1000)
   |> run
</code></pre>
Runs in 1.824s real, 17.635s user and 0.088s system time in under 186000KB, hence less around 200 bytes per thread.<p>10M threads sleeping 10 seconds taxes this machine to:<p>22s real, 4m user, 0.506s system @ 140 bytes/thread.</p>
]]></description><pubDate>Tue, 25 Jul 2023 12:04:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=36861060</link><dc:creator>davidgrenier</dc:creator><comments>https://news.ycombinator.com/item?id=36861060</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=36861060</guid></item><item><title><![CDATA[New comment by davidgrenier in "Python consumes 38x more energy than Java"]]></title><description><![CDATA[
<p>But isn't what makes numpy efficient written in C?</p>
]]></description><pubDate>Thu, 13 Jul 2023 11:01:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=36707361</link><dc:creator>davidgrenier</dc:creator><comments>https://news.ycombinator.com/item?id=36707361</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=36707361</guid></item></channel></rss>