<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Chaitin Ωnumbers and halting problems · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/0904.1149/</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/0904.1149/feed.xml" rel="self" type="application/rss+xml" /><item><title>Chaitin Ωnumbers and halting problems — mentioned by nyrikki</title><link>https://news.ycombinator.com/item?id=43214085</link><guid isPermaLink="false">urn:hackerpapers:mention:0904.1149:43214085</guid><pubDate>Sat, 01 Mar 2025 00:39:36 GMT</pubDate><description>&lt;p&gt;π is a transcendental number meaning that it is not algebraic It is NOT an algorithmically random sequence. Chatlin&amp;#x27;s halting probability is normal, transcendental, and non-computable. https://arxiv.org/pdf/0904.1149 &amp;gt; Chaitin [G. J. Chaitin, J. Assoc. Comput. Mach., vol. 22, pp. 329–340, 1975] introduced Ω number as a concrete example of random real. Being non-algebraic is not the same as being algorithmicly random in the formal sense.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/0904.1149/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.LO</category></item></channel></rss>
