<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: apnorton</title><link>https://news.ycombinator.com/user?id=apnorton</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Thu, 23 Apr 2026 18:33:19 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=apnorton" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by apnorton in "2,100 Swiss municipalities showing which provider handles their official email"]]></title><description><![CDATA[
<p>> TBQH it's crazy to have 2,100 distinct choices.<p>It's crazy to have 2100 distinct municipalities?  The site isn't showing "here are 2100 different email hosts that municipalities in Switzerland use," but rather "here are the 2100 municipalities in Switzerland, and if you click you can see what host each one uses."<p>There's plenty of overlap, just from a cursory look.</p>
]]></description><pubDate>Sun, 19 Apr 2026 23:21:24 +0000</pubDate><link>https://news.ycombinator.com/item?id=47828629</link><dc:creator>apnorton</dc:creator><comments>https://news.ycombinator.com/item?id=47828629</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47828629</guid></item><item><title><![CDATA[New comment by apnorton in "Deterministic Primality Testing for Limited Bit Width"]]></title><description><![CDATA[
<p>The linked post points to OEIS A014233[1] for establishing their set of Miller-Rabin[2] bases, though it's actually possible to find smaller sets.<p>I remember asking about this on StackExchange some years ago [3], which pointed me to Wojciech Izykowski's site[4], on which "best known" base sets are tracked.  For example, instead of considering the four bases {2,3,5,7} to cover all 32-bit integers, it would suffice to consider the three integers {4230279247111683200, 14694767155120705706, 16641139526367750375}.<p>This becomes more interesting the higher the bound you seek --- for example, instead of checking the first 11 prime bases for 64-bit integers, you only need to check the seven bases: 2, 325, 9375, 28178, 450775, 9780504, 1795265022.<p>[1]: <a href="https://oeis.org/A014233" rel="nofollow">https://oeis.org/A014233</a><p>[2]: <a href="https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test" rel="nofollow">https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality...</a><p>[3]: <a href="https://math.stackexchange.com/questions/1004807/" rel="nofollow">https://math.stackexchange.com/questions/1004807/</a><p>[4]: <a href="https://miller-rabin.appspot.com" rel="nofollow">https://miller-rabin.appspot.com</a> or <a href="https://web.archive.org/web/20260225175716/https://miller-rabin.appspot.com/" rel="nofollow">https://web.archive.org/web/20260225175716/https://miller-ra...</a> if hugged to death</p>
]]></description><pubDate>Fri, 10 Apr 2026 17:09:33 +0000</pubDate><link>https://news.ycombinator.com/item?id=47721023</link><dc:creator>apnorton</dc:creator><comments>https://news.ycombinator.com/item?id=47721023</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47721023</guid></item><item><title><![CDATA[New comment by apnorton in "The “JVG algorithm” only wins on tiny numbers"]]></title><description><![CDATA[
<p>This might not be something entirely obvious to people outside of academia, but the <i>vast majority</i> (which I'm only weakening a claim of "totality" in order to guard against unknown instances) of entities that bear the name of humans in the sciences do so because <i>other people</i> decided to call them by that name.<p>From another view, Adelson-Velsky and Landis called their tree algorithm "an algorithm for the organization of information" (or, rather, they did so in Russian --- that's the English translation).  RSA was called "a method" by Rivest, Shamir, and Adleman.  Methods/algorithms/numbers/theorems/etc. generally are not given overly specific names in research papers, in part for practical reasons: researchers will develop many algorithms or theorems, but a very small proportion of these are actually relevant or interesting.  Naming all of them would be a waste of time, so the names tend to be attached <i>well after</i> publication.<p>To name something after oneself requires a degree of hubris that is looked down upon in the general academic community; the reason for this is that there is at least a facade (if not an actual belief) that one's involvement in the sciences should be for the pursuit of truth, not for the pursuit of fame.  Naming something after yourself is, intrinsically, an action taken in the seeking of fame.</p>
]]></description><pubDate>Tue, 10 Mar 2026 06:51:23 +0000</pubDate><link>https://news.ycombinator.com/item?id=47319846</link><dc:creator>apnorton</dc:creator><comments>https://news.ycombinator.com/item?id=47319846</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47319846</guid></item><item><title><![CDATA[New comment by apnorton in "Quanta to publish popular math and physics books by Terence Tao and David Tong"]]></title><description><![CDATA[
<p>It's interesting to see Quanta make a foray into print publishing.  I've long-wished for a print form of Quanta math articles in a monthly magazine, so maybe there is some hope for that eventually?</p>
]]></description><pubDate>Mon, 08 Dec 2025 21:59:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=46198229</link><dc:creator>apnorton</dc:creator><comments>https://news.ycombinator.com/item?id=46198229</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46198229</guid></item><item><title><![CDATA[New comment by apnorton in "AI Mode in Search gets new agentic features and expands globally"]]></title><description><![CDATA[
<p>I remember reading a book on web usability well over a decade ago, and one of the things it pointed out was how Google ensured that the links you wanted to click were "above the fold" --- not ads, but honest-to-goodness search results.<p>Recently, after they added AI-generated search responses (which seem to be wrong a considerable percentage of the time, at least for things I search for), and the inlining of ads to the search results page, I've found I have to scroll <i>at least</i> a full screen height to actually get to the search results a significant portion of the time.<p>The level of blindness to user experience at Google that has allowed the state of search to get to this level is staggering.</p>
]]></description><pubDate>Thu, 21 Aug 2025 13:29:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=44972525</link><dc:creator>apnorton</dc:creator><comments>https://news.ycombinator.com/item?id=44972525</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44972525</guid></item><item><title><![CDATA[New comment by apnorton in "Is the doc bot docs, or not?"]]></title><description><![CDATA[
<p>> There's always an error rate. DocBots are almost certainly wrong more frequently, but they're also almost certainly much much faster than reading the docs.<p>A lot of the discourse around LLM tooling right now boils down to "it's ok to be a bit wrong if you're wrong <i>quickly</i>" ... and then what follows is an ever-further bounds-pushing on how big "a bit" can be.<p>The promise of AI is "human-level (or greater)" --- we should only be using AI when it's as accurate (or more accurate) as human-generated docs, but the tech simply isn't there yet.</p>
]]></description><pubDate>Wed, 09 Jul 2025 17:49:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=44512930</link><dc:creator>apnorton</dc:creator><comments>https://news.ycombinator.com/item?id=44512930</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44512930</guid></item><item><title><![CDATA[New comment by apnorton in "Introduction to the A* Algorithm (2014)"]]></title><description><![CDATA[
<p>The article doesn't <i>explicitly</i> state it in this manner in one concise place, but the way I would always think about A* from a "practical/easy-to-remember" perspective back when I was doing competitive programming is that they're all the same algorithm, but with different priorities on the priority queue:<p>Breadth-first Search: Priority is order of discovery of edges (that is, no priority queue/just a regular queue)<p>Dijkstra: Priority is distance so far + next edge distance<p>A*: Priority is distance so far + next edge distance + <i>estimate</i> of distance to target node.<p>This also helps me remember whether the estimate must over- or under-estimate: Since Dijkstra is making the estimate "0", clearly the "admissible heuristic" criteria must be an under-estimation.</p>
]]></description><pubDate>Wed, 18 Jun 2025 13:51:00 +0000</pubDate><link>https://news.ycombinator.com/item?id=44309878</link><dc:creator>apnorton</dc:creator><comments>https://news.ycombinator.com/item?id=44309878</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44309878</guid></item><item><title><![CDATA[New comment by apnorton in "Generate art from any text with deep learning"]]></title><description><![CDATA[
<p>The [Drunken Bishop](<a href="https://www.jfurness.uk/the-drunken-bishop-algorithm/" rel="nofollow">https://www.jfurness.uk/the-drunken-bishop-algorithm/</a>) algorithm works well for this purpose, without needing a GPU. :)</p>
]]></description><pubDate>Mon, 09 Aug 2021 18:17:15 +0000</pubDate><link>https://news.ycombinator.com/item?id=28120258</link><dc:creator>apnorton</dc:creator><comments>https://news.ycombinator.com/item?id=28120258</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=28120258</guid></item><item><title><![CDATA[New comment by apnorton in "Happy Birthday, OpenStreetMap"]]></title><description><![CDATA[
<p>This is cool data! ...however, I must ask --- where does the data come from?<p>HN certainly has a side that loves open-source data, but it also has a privacy-loving side.  Focusing on the privacy aspects, has TomTom given any consideration to how it respects the privacy of its users/does it allow for opt-out of storing and analyzing its users' GPS traces?</p>
]]></description><pubDate>Mon, 09 Aug 2021 17:11:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=28119442</link><dc:creator>apnorton</dc:creator><comments>https://news.ycombinator.com/item?id=28119442</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=28119442</guid></item><item><title><![CDATA[New comment by apnorton in "The most copied StackOverflow snippet of all time is flawed (2019)"]]></title><description><![CDATA[
<p>There are three buttons that act as sorting directions at the top of the answers section: "Votes," "Oldest," and "Active."  The "Active" option sorts by most recently modified, which is _usually_ what you'd want instead of strictly newest. (i.e. an edit would update the timestamp, making that answer have a more recent activity date)<p>So, I guess the answer to your question of "why can't I" is "good news! you can" :)</p>
]]></description><pubDate>Thu, 17 Jun 2021 05:00:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=27536262</link><dc:creator>apnorton</dc:creator><comments>https://news.ycombinator.com/item?id=27536262</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=27536262</guid></item></channel></rss>