The Computational Complexity of Structure-Based Causality · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/1412.3076/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTThe Computational Complexity of Structure-Based Causality — mentioned by nyrikkihttps://news.ycombinator.com/item?id=39661640urn:hackerpapers:mention:1412.3076:39661640Sun, 10 Mar 2024 19:04:49 GMT<p>LLMs are trained to sound confident. But they can also only do negation through exhaustion, known unknowns, future unknowns, etc... That is the pain of the Entscheidungsproblem. Even in Presburger arithmetic, Natural numbers will addition and equality, which is decidable, still has a double factorial time complexity to prove. That is worse than factorial time for those who&#x27;ve not dealt with it. Add in multiplication then you are undecidable. Even if you decided to use the dag like structure of transformers, causality is very very hard. https://arxiv.org/abs/1412.3076 LLMs only have cheap…</p><p><a href="https://hackerpaper.kaipfister.de/p/1412.3076/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.AI