<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: JohnKemeny</title><link>https://news.ycombinator.com/user?id=JohnKemeny</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Mon, 07 Sep 2026 16:30:44 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=JohnKemeny" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by JohnKemeny in "Palomar: A registry of Lean verified mathematics"]]></title><description><![CDATA[
<p>Not trying to answer on OP's behalf, but perhaps they didn't mean blockchain in the literal sense, but more like a DAG of theorems that are shared globally?</p>
]]></description><pubDate>Wed, 19 Aug 2026 07:19:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=49358057</link><dc:creator>JohnKemeny</dc:creator><comments>https://news.ycombinator.com/item?id=49358057</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49358057</guid></item><item><title><![CDATA[New comment by JohnKemeny in "Compression is prediction"]]></title><description><![CDATA[
<p>I probably didn't understand what you meant by<p>> <i>Hutter Prize being where you are paid if you can compress wikipedia small enough. LLMs do very well at that, if, big if, you ignore the cost of initial weights.</i><p>then.<p>If all you care about is compressing Wikipedia, but ignore the size of the actual data, what is it that you are actually trying to do?</p>
]]></description><pubDate>Tue, 18 Aug 2026 08:06:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=49342819</link><dc:creator>JohnKemeny</dc:creator><comments>https://news.ycombinator.com/item?id=49342819</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49342819</guid></item><item><title><![CDATA[New comment by JohnKemeny in "Compression is prediction"]]></title><description><![CDATA[
<p>> <i>ignore the cost of initial weights</i><p>Well, then Wikipedia itself is a very good compression that only needs the title to perfectly predict the full article.</p>
]]></description><pubDate>Mon, 17 Aug 2026 12:36:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=49329855</link><dc:creator>JohnKemeny</dc:creator><comments>https://news.ycombinator.com/item?id=49329855</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49329855</guid></item><item><title><![CDATA[New comment by JohnKemeny in "NP-overrated"]]></title><description><![CDATA[
<p>Maximum flow isn't NP-hard, though.  It can be solved in near-linear time.</p>
]]></description><pubDate>Fri, 14 Aug 2026 07:30:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=49295662</link><dc:creator>JohnKemeny</dc:creator><comments>https://news.ycombinator.com/item?id=49295662</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49295662</guid></item><item><title><![CDATA[New comment by JohnKemeny in "NP-overrated"]]></title><description><![CDATA[
<p>If you allow twice the solution, you can do it in <i>O(m log n)</i> time using MST.</p>
]]></description><pubDate>Fri, 14 Aug 2026 07:28:35 +0000</pubDate><link>https://news.ycombinator.com/item?id=49295650</link><dc:creator>JohnKemeny</dc:creator><comments>https://news.ycombinator.com/item?id=49295650</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49295650</guid></item><item><title><![CDATA[New comment by JohnKemeny in "NP-overrated"]]></title><description><![CDATA[
<p>You can't do it faster than <i>O(n log n)</i> for the simple reason that you need to sort the frequencies.  If the symbols come sorted, then you can do it in <i>O(n)</i> time, yes, using two queues.</p>
]]></description><pubDate>Fri, 14 Aug 2026 07:26:19 +0000</pubDate><link>https://news.ycombinator.com/item?id=49295630</link><dc:creator>JohnKemeny</dc:creator><comments>https://news.ycombinator.com/item?id=49295630</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49295630</guid></item><item><title><![CDATA[New comment by JohnKemeny in "NP-overrated"]]></title><description><![CDATA[
<p>I think the phrase you're looking for is the <i>phase transition</i>.<p>Discussed here: <a href="https://cstheory.stackexchange.com/questions/33550" rel="nofollow">https://cstheory.stackexchange.com/questions/33550</a></p>
]]></description><pubDate>Fri, 14 Aug 2026 07:19:29 +0000</pubDate><link>https://news.ycombinator.com/item?id=49295592</link><dc:creator>JohnKemeny</dc:creator><comments>https://news.ycombinator.com/item?id=49295592</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49295592</guid></item><item><title><![CDATA[New comment by JohnKemeny in "How Claude marks AI-generated content"]]></title><description><![CDATA[
<p>True, but what you <i>can do</i> is a one-sided guarantee.  If it bears the mark, it is likely generated (or someone deliberately made it look generated).<p>Thus, if a news article, research article, book, student paper submission, <i>blog post</i>, HN comment, etc, bears the mark, it could be automatically flagged as such.<p>It helps detect low effort slop.<p>---<p><i>Caveat.</i>  If you write your own creative work and send it to Claude for "cleaning up grammar", it might insert the watermark.</p>
]]></description><pubDate>Tue, 11 Aug 2026 09:44:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=49255555</link><dc:creator>JohnKemeny</dc:creator><comments>https://news.ycombinator.com/item?id=49255555</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49255555</guid></item><item><title><![CDATA[New comment by JohnKemeny in "Reviving a four year old reMarkable 2"]]></title><description><![CDATA[
<p>You don't have to "revive" the device <i>in order to use it</i>.<p>The problem was: out-of-sync device clock prevented software updates which in turn prevented cloud syncing.  You don't <i>need</i> software updates or cloud syncing for the device to work.<p>The fix is to set the clock and do the software updates.</p>
]]></description><pubDate>Mon, 10 Aug 2026 10:53:38 +0000</pubDate><link>https://news.ycombinator.com/item?id=49242030</link><dc:creator>JohnKemeny</dc:creator><comments>https://news.ycombinator.com/item?id=49242030</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49242030</guid></item><item><title><![CDATA[New comment by JohnKemeny in "Unlimited OCR: One-shot long-horizon parsing"]]></title><description><![CDATA[
<p>OCR has definitely not "been solved long time ago", what are you talking about?<p>In your opinion, what is SOTA here?</p>
]]></description><pubDate>Tue, 23 Jun 2026 12:25:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=48643914</link><dc:creator>JohnKemeny</dc:creator><comments>https://news.ycombinator.com/item?id=48643914</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48643914</guid></item><item><title><![CDATA[New comment by JohnKemeny in "Ultralytics YOLO26: Unified Real-Time End-to-End Vision Models"]]></title><description><![CDATA[
<p>Related: <i>An Introduction to YOLO26</i><p>77 points, 24 comments<p><a href="https://news.ycombinator.com/item?id=48639165">https://news.ycombinator.com/item?id=48639165</a></p>
]]></description><pubDate>Tue, 23 Jun 2026 10:59:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=48643125</link><dc:creator>JohnKemeny</dc:creator><comments>https://news.ycombinator.com/item?id=48643125</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48643125</guid></item><item><title><![CDATA[New comment by JohnKemeny in "LLMs do not merely reflect the bias of their training, they police it"]]></title><description><![CDATA[
<p>Follow-up.  I in fact suspect that either she is a bot, or she is using an LLM to spew out papers.  She uploads about one paper per month to Zenodo, and they all seem very AI generated.</p>
]]></description><pubDate>Mon, 22 Jun 2026 13:01:04 +0000</pubDate><link>https://news.ycombinator.com/item?id=48629594</link><dc:creator>JohnKemeny</dc:creator><comments>https://news.ycombinator.com/item?id=48629594</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48629594</guid></item><item><title><![CDATA[New comment by JohnKemeny in "LLMs do not merely reflect the bias of their training, they police it (2025)"]]></title><description><![CDATA[
<p>The paper under discussion:<p><a href="https://zenodo.org/records/17720178" rel="nofollow">https://zenodo.org/records/17720178</a><p>Note that Zenodo is a DOI-provider, not a (scientific) journal.  Anyone can upload anything to Zenodo.  It's less strict than arXiv.<p><i>Edit:</i>  The "paper" is written by one Hiroko Konishi, an <i>independent researcher</i> (she is a voice actress).</p>
]]></description><pubDate>Mon, 22 Jun 2026 12:20:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=48629189</link><dc:creator>JohnKemeny</dc:creator><comments>https://news.ycombinator.com/item?id=48629189</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48629189</guid></item><item><title><![CDATA[New comment by JohnKemeny in "LLMs do not merely reflect the bias of their training, they police it (2025)"]]></title><description><![CDATA[
<p>yeah, only authorities are considered here at HN.</p>
]]></description><pubDate>Mon, 22 Jun 2026 12:18:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=48629148</link><dc:creator>JohnKemeny</dc:creator><comments>https://news.ycombinator.com/item?id=48629148</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48629148</guid></item><item><title><![CDATA[New comment by JohnKemeny in "There Is(Ǝ) – Such That (∋)"]]></title><description><![CDATA[
<p>It also doesn't make much sense<p>> There exists a raven such that the vector of hours.<p>The vector of hours what?</p>
]]></description><pubDate>Mon, 15 Jun 2026 11:10:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=48539587</link><dc:creator>JohnKemeny</dc:creator><comments>https://news.ycombinator.com/item?id=48539587</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48539587</guid></item><item><title><![CDATA[New comment by JohnKemeny in "Unicode 18.0.0 Beta"]]></title><description><![CDATA[
<p>If the seahorse emoji is introduced, we will have to train new foundation models.  The costs connected to the introduction of the seahorse emoji will be in the billions.</p>
]]></description><pubDate>Wed, 27 May 2026 09:35:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=48291802</link><dc:creator>JohnKemeny</dc:creator><comments>https://news.ycombinator.com/item?id=48291802</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48291802</guid></item><item><title><![CDATA[New comment by JohnKemeny in "On The <dl> (2021)"]]></title><description><![CDATA[
<p>Isn't it <i>description</i> list?</p>
]]></description><pubDate>Sat, 23 May 2026 20:22:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=48251108</link><dc:creator>JohnKemeny</dc:creator><comments>https://news.ycombinator.com/item?id=48251108</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48251108</guid></item><item><title><![CDATA[New comment by JohnKemeny in "Chess invariants"]]></title><description><![CDATA[
<p>3.9.2: no piece can be moved if that exposes or leaves its own king in check.</p>
]]></description><pubDate>Fri, 22 May 2026 12:37:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=48235037</link><dc:creator>JohnKemeny</dc:creator><comments>https://news.ycombinator.com/item?id=48235037</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48235037</guid></item><item><title><![CDATA[New comment by JohnKemeny in "Chess invariants"]]></title><description><![CDATA[
<p>Well, if a piece is <i>pinned</i> it's <i>illegal</i> to move it.<p><i>Rule 3.9.2: No piece can be moved that will either expose the king of the same colour to check or leave that king in check.</i></p>
]]></description><pubDate>Fri, 22 May 2026 12:10:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=48234772</link><dc:creator>JohnKemeny</dc:creator><comments>https://news.ycombinator.com/item?id=48234772</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48234772</guid></item><item><title><![CDATA[New comment by JohnKemeny in "Python 3.15: features that didn't make the headlines"]]></title><description><![CDATA[
<p>> <i>I've left this one to the bonus section because I've never used set operations on Counters and I'm finding it extremely hard to think of a use case for xor specifically. But I do appreciate the devs adding it for completeness.</i><p>Check out <i>symmetric difference</i><p><a href="https://en.wikipedia.org/wiki/Symmetric_difference" rel="nofollow">https://en.wikipedia.org/wiki/Symmetric_difference</a></p>
]]></description><pubDate>Thu, 21 May 2026 12:28:16 +0000</pubDate><link>https://news.ycombinator.com/item?id=48221556</link><dc:creator>JohnKemeny</dc:creator><comments>https://news.ycombinator.com/item?id=48221556</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48221556</guid></item></channel></rss>