<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>On non-detectability of non-computability and the degree of non-computability of solutions of circuit and wave equations on digital computers · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2205.12626/</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/2205.12626/feed.xml" rel="self" type="application/rss+xml" /><item><title>On non-detectability of non-computability and the degree of non-computability of solutions of circuit and wave equations on digital computers — mentioned by Animats</title><link>https://news.ycombinator.com/item?id=41302454</link><guid isPermaLink="false">urn:hackerpapers:mention:2205.12626:41302454</guid><pubDate>Tue, 20 Aug 2024 18:13:24 GMT</pubDate><description>&lt;p&gt;&amp;gt; This article is bullshit. It fails to mention the many limitations of analog hardware. Right. The actual paper cited: [1] That&amp;#x27;s an unrelated result. It comes from the observation that some functions are not usefully differentiable by sampling and differencing. If the function has fractal-like infinite detail, two samples taken close together have somewhat arbitrary differences. Some people who get wound up about the halting problem have latched onto this idea and try to make a big deal out of it. Any analog system with non-zero noise, which is all of them, effectively has the same problem.…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2205.12626/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.IT</category></item><item><title>On non-detectability of non-computability and the degree of non-computability of solutions of circuit and wave equations on digital computers — HN submission</title><link>https://news.ycombinator.com/item?id=41149931</link><guid isPermaLink="false">urn:hackerpapers:submission:2205.12626:41149931</guid><pubDate>Sat, 03 Aug 2024 23:02:33 GMT</pubDate><description>&lt;p&gt;Non-computability of solutions of certain equations on digital computers (2022)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;88 points; 102 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2205.12626/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.IT</category></item></channel></rss>
