<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Computability Theory of Closed Timelike Curves · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1609.05507/</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/1609.05507/feed.xml" rel="self" type="application/rss+xml" /><item><title>Computability Theory of Closed Timelike Curves — mentioned by raatmarien</title><link>https://news.ycombinator.com/item?id=38938657</link><guid isPermaLink="false">urn:hackerpapers:mention:1609.05507:38938657</guid><pubDate>Wed, 10 Jan 2024 10:34:57 GMT</pubDate><description>&lt;p&gt;Really cool project! It might be interesting to note that the mentioned time travel paradoxes can be solved by using probablistic states (as multi-valued interpretations of quantum mechanics would imply would be the case in any real system with time travel). And that this results in a computational system that can solve &amp;#x27;uncomputable&amp;#x27; problems like the halting problem. See https://arxiv.org/abs/1609.05507. Time travel is really fun to think about in a computational setting!&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1609.05507/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item></channel></rss>
