<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>An Exact Rounds-versus-Queries Trade-off for Pointer Chasing, Machine-Checked in Lean 4 · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2510.08577/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:27:26 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2510.08577/feed.xml" rel="self" type="application/rss+xml" /><item><title>An Exact Rounds-versus-Queries Trade-off for Pointer Chasing, Machine-Checked in Lean 4 — HN submission</title><link>https://news.ycombinator.com/item?id=45565570</link><guid isPermaLink="false">urn:hackerpapers:submission:2510.08577:45565570</guid><pubDate>Mon, 13 Oct 2025 07:06:12 GMT</pubDate><description>&lt;p&gt;New Preprint:Psi-Turing Machines – Bounded Introspection for Complexity Barriers&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;4 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2510.08577/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CC</category></item></channel></rss>
