<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A definable number which cannot be approximated algorithmically · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1003.0480/</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/1003.0480/feed.xml" rel="self" type="application/rss+xml" /><item><title>A definable number which cannot be approximated algorithmically — mentioned by moefh</title><link>https://news.ycombinator.com/item?id=14082540</link><guid isPermaLink="false">urn:hackerpapers:mention:1003.0480:14082540</guid><pubDate>Mon, 10 Apr 2017 21:04:33 GMT</pubDate><description>&lt;p&gt;I don&amp;#x27;t think that argument works. How do you guarantee that you can compute the n-th decimal of the n-th number in the list? In fact, from what I understand, this paper[1] shows how to specify exactly a number can&amp;#x27;t be computed like that. [1] https://arxiv.org/pdf/1003.0480.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1003.0480/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CC</category></item></channel></rss>
