<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: imurray</title><link>https://news.ycombinator.com/user?id=imurray</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Wed, 28 Oct 2026 06:14:15 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=imurray" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by imurray in "The Aaronson Oracle"]]></title><description><![CDATA[
<p>Here's a more recent implementation of rock paper scissors with an Aaronson Oracle: <a href="https://rpsoracle.netlify.app/example/" rel="nofollow">https://rpsoracle.netlify.app/example/</a></p>
]]></description><pubDate>Wed, 14 Oct 2026 13:06:24 +0000</pubDate><link>https://news.ycombinator.com/item?id=50087151</link><dc:creator>imurray</dc:creator><comments>https://news.ycombinator.com/item?id=50087151</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50087151</guid></item><item><title><![CDATA[New comment by imurray in "F-Droid 2.0"]]></title><description><![CDATA[
<p>Ooh, thanks for this. Also, long pressing "My apps", or pressing the (+) next to it, lets us create a homescreen icon directly to "My apps".</p>
]]></description><pubDate>Fri, 25 Sep 2026 11:00:04 +0000</pubDate><link>https://news.ycombinator.com/item?id=49842797</link><dc:creator>imurray</dc:creator><comments>https://news.ycombinator.com/item?id=49842797</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49842797</guid></item><item><title><![CDATA[New comment by imurray in "Faster NumPy in the Browser"]]></title><description><![CDATA[
<p>The reference implementation of BLAS is in Fortran, but these days fast implementations (using the same interface) tend not to be. OpenBLAS is in C and much of MKL is in C/C++. An individual widely-used package can be rewritten, much like improving a compiler, or giving it a new output, benefits lots of software all at once.<p>However, OpenBLAS still links to the reference LAPACK in Fortran, because it's mostly made fast by linking it to a good BLAS implementation. It could be rewritten, or converted to C with f2c. Although there's a long tail of useful but often niche Fortran software, some in Fortran 90 that f2c can't convert. Having a fortran compiler is still useful, and covers all of them at once. Potentially that compiler could compile to another language, to cover more and future platforms all at once (like f2c does). It looks like that's what's going on here, compiling fortran to wasm.</p>
]]></description><pubDate>Sun, 20 Sep 2026 11:08:33 +0000</pubDate><link>https://news.ycombinator.com/item?id=49774614</link><dc:creator>imurray</dc:creator><comments>https://news.ycombinator.com/item?id=49774614</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49774614</guid></item><item><title><![CDATA[New comment by imurray in "More German than many Germans"]]></title><description><![CDATA[
<p>> It shouldn't be too hard for the gov to commission a RosettaStone like german learning app ((suboptimal, i know)) that works somewhat well and give it out for free, right?)<p>Deutsche Welle (DW) is funded by German taxes and has materials for learning German: <a href="https://learngerman.dw.com/" rel="nofollow">https://learngerman.dw.com/</a> as well as regular new materials aimed at learners, such as the news spoken slowly <a href="https://learngerman.dw.com/de/langsam-gesprochene-nachrichten/s-60040332" rel="nofollow">https://learngerman.dw.com/de/langsam-gesprochene-nachrichte...</a> -- although I found it easier to listen to the normal news (e.g. tagesschau) slowed down slightly. (W-h-e-n  p-e-o-p-l-e  s-p-e-a-k  s-l-o-w-l-y  i-t  c-a-n  b-e  h-a-r-d-e-r  t-o  l-i-s-t-e-n  t-o!)<p>Not state-funded, but I recommend <a href="https://www.easygerman.org/" rel="nofollow">https://www.easygerman.org/</a> -- they have lots of good youtube material, a nice podcast, and an app I've not used. Most of the material is free with bonus materials for supporters.</p>
]]></description><pubDate>Mon, 03 Aug 2026 07:36:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=49152440</link><dc:creator>imurray</dc:creator><comments>https://news.ycombinator.com/item?id=49152440</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49152440</guid></item><item><title><![CDATA[New comment by imurray in "Some combinatorial applications of spacefilling curves"]]></title><description><![CDATA[
<p>John Skilling has used a generalization of the Hilbert curve to n-dimensions in his BayeSys software for Bayesian inference: <a href="https://www.inference.org.uk/bayesys/" rel="nofollow">https://www.inference.org.uk/bayesys/</a> -- the manual describes how (pdftex will make a nice pdf), with further references, and C code is available.</p>
]]></description><pubDate>Tue, 28 Jul 2026 11:24:13 +0000</pubDate><link>https://news.ycombinator.com/item?id=49082254</link><dc:creator>imurray</dc:creator><comments>https://news.ycombinator.com/item?id=49082254</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49082254</guid></item><item><title><![CDATA[New comment by imurray in "Matrix Orthogonalization Improves Memory in Recurrent Models"]]></title><description><![CDATA[
<p>Here is a pytorch optimizer that can maintain a matrix as orthogonal throughout optimization:<p><a href="https://github.com/adrianjav/pogo" rel="nofollow">https://github.com/adrianjav/pogo</a> — POGO: A Proximal One-step Geometric Orthoptimizer<p><a href="https://arxiv.org/abs/2602.14656" rel="nofollow">https://arxiv.org/abs/2602.14656</a> — An Embarrassingly Simple Way to Optimize Orthogonal Matrices at Scale; Adrián Javaloy, Antonio Vergari</p>
]]></description><pubDate>Wed, 01 Jul 2026 14:04:44 +0000</pubDate><link>https://news.ycombinator.com/item?id=48747009</link><dc:creator>imurray</dc:creator><comments>https://news.ycombinator.com/item?id=48747009</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48747009</guid></item><item><title><![CDATA[New comment by imurray in "Alternatives to Nested If Function"]]></title><description><![CDATA[
<p>I think you're thinking of "You Suck at Excel" by Joel Spolsky. <a href="https://www.youtube.com/watch?v=JxBg4sMusIg" rel="nofollow">https://www.youtube.com/watch?v=JxBg4sMusIg</a><p>Lots of past HN discussion... <a href="https://hn.algolia.com/?q=you+suck+at+excel" rel="nofollow">https://hn.algolia.com/?q=you+suck+at+excel</a><p>That video was before the introduction of xlookup, which I believe is now worth considering over index and match.</p>
]]></description><pubDate>Mon, 29 Jun 2026 19:35:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=48724025</link><dc:creator>imurray</dc:creator><comments>https://news.ycombinator.com/item?id=48724025</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48724025</guid></item><item><title><![CDATA[New comment by imurray in "Did Claude increase bugs in rsync?"]]></title><description><![CDATA[
<p>The Ubuntu backport did include regressions that an Ubuntu update a couple of days later addresses: <a href="https://ubuntu.com/security/notices/USN-8349-2" rel="nofollow">https://ubuntu.com/security/notices/USN-8349-2</a></p>
]]></description><pubDate>Tue, 09 Jun 2026 07:44:05 +0000</pubDate><link>https://news.ycombinator.com/item?id=48457926</link><dc:creator>imurray</dc:creator><comments>https://news.ycombinator.com/item?id=48457926</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48457926</guid></item><item><title><![CDATA[New comment by imurray in "Did Claude increase bugs in rsync?"]]></title><description><![CDATA[
<p>That version has security fixes from the same day as the latest rsync release: <a href="https://ubuntu.com/security/notices/USN-8283-1" rel="nofollow">https://ubuntu.com/security/notices/USN-8283-1</a><p>As usual, Ubuntu backported fixes and didn't upgrade to a new version. Whether or not they also backported regressions in edge cases that afflict the latest rsync, I don't know. Pinning the Ubuntu package may prevent getting further regressions, but is preventing you getting any future such backported security fixes.</p>
]]></description><pubDate>Fri, 05 Jun 2026 13:19:03 +0000</pubDate><link>https://news.ycombinator.com/item?id=48412131</link><dc:creator>imurray</dc:creator><comments>https://news.ycombinator.com/item?id=48412131</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48412131</guid></item><item><title><![CDATA[New comment by imurray in "Jensen–Shannon Divergence"]]></title><description><![CDATA[
<p>For those wanting alternatives to KL-divergence, the KL and Jensen–Shannon divergences are both F-divergences: <a href="https://en.wikipedia.org/wiki/F-divergence" rel="nofollow">https://en.wikipedia.org/wiki/F-divergence</a></p>
]]></description><pubDate>Tue, 26 May 2026 08:51:45 +0000</pubDate><link>https://news.ycombinator.com/item?id=48276974</link><dc:creator>imurray</dc:creator><comments>https://news.ycombinator.com/item?id=48276974</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48276974</guid></item><item><title><![CDATA[New comment by imurray in "The Road Not Taken: A World Where IPv4 Evolved"]]></title><description><![CDATA[
<p>Reminds me of <a href="https://cr.yp.to/djbdns/ipv6mess.html" rel="nofollow">https://cr.yp.to/djbdns/ipv6mess.html</a><p>Which has been discussed previously: <a href="https://hn.algolia.com/?q=The+IPv6+mess" rel="nofollow">https://hn.algolia.com/?q=The+IPv6+mess</a></p>
]]></description><pubDate>Thu, 12 Mar 2026 18:17:53 +0000</pubDate><link>https://news.ycombinator.com/item?id=47355016</link><dc:creator>imurray</dc:creator><comments>https://news.ycombinator.com/item?id=47355016</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47355016</guid></item><item><title><![CDATA[New comment by imurray in "The Road Not Taken: A World Where IPv4 Evolved"]]></title><description><![CDATA[
<p>I think that's meant to be covered by the "IPv4x when we can. NAT when we must" part, in particular "ISPs used carrier‑grade NAT as a compatibility shim rather than a lifeline: if you needed to reach an IPv4‑only service, CGNAT stepped in while IPv4x traffic flowed natively and without ceremony."<p>It seemed strange that the need for CGNAT wasn't mentioned until after the MIT story. The "Nothing broke" claim in that story seems unlikely; I was on a public IP at University at the end of the 90s and if I'd suddenly been put behind NAT, some things I did would have broken until the workarounds were worked out.</p>
]]></description><pubDate>Thu, 12 Mar 2026 18:13:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=47354967</link><dc:creator>imurray</dc:creator><comments>https://news.ycombinator.com/item?id=47354967</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47354967</guid></item><item><title><![CDATA[New comment by imurray in "The Falkirk Wheel"]]></title><description><![CDATA[
<p>Ooof, I'd never seen that. Thanks! From the wikipedia link:<p>> The May 1799 test at Oakengates carried a party of investors aboard the vessel, who nearly suffocated before they could be freed.<p>(!) ...and eventually they built a flight of nineteen locks instead, with a steam-powered pump to return water. The lift locks (and Falkirk Wheel) are a really impressive and elegant solution in comparison.</p>
]]></description><pubDate>Wed, 11 Feb 2026 15:07:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=46975867</link><dc:creator>imurray</dc:creator><comments>https://news.ycombinator.com/item?id=46975867</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46975867</guid></item><item><title><![CDATA[New comment by imurray in "The Falkirk Wheel"]]></title><description><![CDATA[
<p>The Falkirk Wheel is cool and a fun trip, along with the nearby Kelpies, which were much more striking in person than I'd anticipated.<p>The wheel is a one-of-a-kind, but there are other ways of avoiding having a ladder of flood locks, see: <a href="https://en.wikipedia.org/wiki/Boat_lift" rel="nofollow">https://en.wikipedia.org/wiki/Boat_lift</a><p>I really liked this one in Peterborough, Ontario, Canada: <a href="https://en.wikipedia.org/wiki/Peterborough_Lift_Lock" rel="nofollow">https://en.wikipedia.org/wiki/Peterborough_Lift_Lock</a>
Built as a real working lift lock (originally 1904), rather than as a tourist attraction. Powered by a little bit of extra water in one of the buckets to tip the balance and drive the pistons.</p>
]]></description><pubDate>Wed, 11 Feb 2026 10:31:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=46973302</link><dc:creator>imurray</dc:creator><comments>https://news.ycombinator.com/item?id=46973302</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46973302</guid></item><item><title><![CDATA[New comment by imurray in "Show HN: Yourshoesmells.com – Find the most smelly boulder gym"]]></title><description><![CDATA[
<p>The site didn't load for me in Firefox, but I found these fantastic for preventing climbing shoe stink: <a href="https://bootbananas.com/product/original-shoe-deodorisers/" rel="nofollow">https://bootbananas.com/product/original-shoe-deodorisers/</a>  They absorb sweat, not just mask the smell.</p>
]]></description><pubDate>Tue, 04 Nov 2025 11:32:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=45809776</link><dc:creator>imurray</dc:creator><comments>https://news.ycombinator.com/item?id=45809776</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45809776</guid></item><item><title><![CDATA[New comment by imurray in "Anscombe's Quartet"]]></title><description><![CDATA[
<p>It's clearly hard, but there are tools for doing exploratory visualization of high-dim data. GGobi <a href="http://ggobi.org/" rel="nofollow">http://ggobi.org/</a> and all the ones that arrange points but try to get local neighborhoods correct (t-sne, umap, et al.).</p>
]]></description><pubDate>Tue, 09 Sep 2025 13:47:16 +0000</pubDate><link>https://news.ycombinator.com/item?id=45181856</link><dc:creator>imurray</dc:creator><comments>https://news.ycombinator.com/item?id=45181856</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45181856</guid></item><item><title><![CDATA[New comment by imurray in "What Is Complexity in Chess?"]]></title><description><![CDATA[
<p>Some things that may be of interest. First relevant to the posted article:<p>A site that has used neural nets to classify go moves that good players would probably make that weaker players (of varying ranks) would probably not: <a href="https://neuralnetgoproblems.com/" rel="nofollow">https://neuralnetgoproblems.com/</a>  (code available on github)<p><a href="https://ai-sensei.com/challenge" rel="nofollow">https://ai-sensei.com/challenge</a> (behind login wall, and in future possibly a pay wall) is a similar idea, but the difficulty of evaluating the position is determined by how users of the site perform in practice.<p>And more generally, but relevant to your comment:<p>Players can play humans at an appropriate rank on OGS <a href="https://online-go.com/" rel="nofollow">https://online-go.com/</a> (not as popular as the Eastern servers, but probably popular enough) -- or against calibrated rank "human-like" AI players by painfully setting up the right katago models themselves, or by paying for a subscription on ai-sensei.com<p>A go education site that's currently largely by and pitched at Westerners: <a href="https://gomagic.org/" rel="nofollow">https://gomagic.org/</a> for leveling up from the basics.<p>And a lot of books are now available easily and electronically in English (and some in German): <a href="https://gobooks.com/" rel="nofollow">https://gobooks.com/</a>  --- I'd recommend "graded go problems for beginners", "tesuji", and "attack and defense".<p>Some good sites aren't (fully) available in English, like <a href="https://www.101weiqi.com/" rel="nofollow">https://www.101weiqi.com/</a> -- but there are chrome and firefox extensions to translate just enough of it to make it usable.<p>[To help search engines: go is also known as weiqi and baduk]</p>
]]></description><pubDate>Mon, 01 Sep 2025 13:53:16 +0000</pubDate><link>https://news.ycombinator.com/item?id=45092695</link><dc:creator>imurray</dc:creator><comments>https://news.ycombinator.com/item?id=45092695</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45092695</guid></item><item><title><![CDATA[New comment by imurray in "Blazing Matrix Products"]]></title><description><![CDATA[
<p>This post is for those interested high-performance matrix multiplication in BQN (an APL-like array language).<p>The main thing I got out of it was the footnotes, in particular: <a href="https://en.algorithmica.org/hpc/algorithms/matmul/" rel="nofollow">https://en.algorithmica.org/hpc/algorithms/matmul/</a> is a really nice post on fast matrix multiplication, and is a chapter of what looks like a nice online book.</p>
]]></description><pubDate>Fri, 27 Jun 2025 12:14:57 +0000</pubDate><link>https://news.ycombinator.com/item?id=44396177</link><dc:creator>imurray</dc:creator><comments>https://news.ycombinator.com/item?id=44396177</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44396177</guid></item><item><title><![CDATA[New comment by imurray in "The bitter lesson is coming for tokenization"]]></title><description><![CDATA[
<p>A PhD thesis that explores some aspects of the limitation: <a href="https://era.ed.ac.uk/handle/1842/42931" rel="nofollow">https://era.ed.ac.uk/handle/1842/42931</a><p>Detecting and preventing unargmaxable outputs in bottlenecked neural networks, Andreas Grivas (2024)</p>
]]></description><pubDate>Tue, 24 Jun 2025 17:31:29 +0000</pubDate><link>https://news.ycombinator.com/item?id=44368629</link><dc:creator>imurray</dc:creator><comments>https://news.ycombinator.com/item?id=44368629</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44368629</guid></item><item><title><![CDATA[New comment by imurray in "How to (actually) send DTMF on Android without being the default call app"]]></title><description><![CDATA[
<p>> generating DTMF tones yourself and injecting them into the audio stream?<p>When I was an undergrad I had an audio file for each digit and a winamp playlist for each of my frequently dialed numbers. I'd hold my (landline) phone against the computer speakers and double-click the playlist to dial. I'm sure I spent more time setting this up than it ever saved, but it was somehow pleasing that this ridiculously over-powered speed dialer worked.</p>
]]></description><pubDate>Fri, 06 Jun 2025 16:37:27 +0000</pubDate><link>https://news.ycombinator.com/item?id=44202586</link><dc:creator>imurray</dc:creator><comments>https://news.ycombinator.com/item?id=44202586</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44202586</guid></item></channel></rss>