<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Post-Hoc Reasoning in Chain of Thought: Decoding and Steering Pre-Committed Answers · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2603.01437/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2603.01437/feed.xml" rel="self" type="application/rss+xml" /><item><title>Post-Hoc Reasoning in Chain of Thought: Decoding and Steering Pre-Committed Answers — mentioned by shawntan</title><link>https://news.ycombinator.com/item?id=49630418</link><guid isPermaLink="false">urn:hackerpapers:mention:2603.01437:49630418</guid><pubDate>Wed, 09 Sep 2026 17:49:05 GMT</pubDate><description>&lt;p&gt;For the research focused, there are some references in my blogpost here on what kinds of computational problems minimally require how much CoT to solve: https://blog.wtf.sg/posts/2023-02-03-the-new-xor-problem/ Notably Will Merrill&amp;#x27;s work: https://arxiv.org/abs/2310.07923 As for how universal transformers (looping transformers, but everyone has since forgotten prior work) will affect this, Will Merrill (again) has a paper here (https://arxiv.org/abs/2503.03961) that discusses exactly this. The original universal transformers is called &amp;quot;universal&amp;quot; because if you allow for per-token looping…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2603.01437/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item></channel></rss>
