<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Using biased coins as oracles · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/cs_0401019/</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/cs_0401019/feed.xml" rel="self" type="application/rss+xml" /><item><title>Using biased coins as oracles — mentioned by it</title><link>https://news.ycombinator.com/item?id=21831938</link><guid isPermaLink="false">urn:hackerpapers:mention:cs_0401019:21831938</guid><pubDate>Thu, 19 Dec 2019 04:01:20 GMT</pubDate><description>&lt;p&gt;Finite memory just means a limited subset of what a Turing machine can do. Concurrency doesn&amp;#x27;t make Turing computable processes capable of anything beyond what they can already do. At best it buys them speed, maybe some expressiveness for the programmer, and bugs. Nondeterminism is useful for some algorithms but it also doesn&amp;#x27;t make it possible for Turing computable processes to go beyond Turing computability. See for example https://arxiv.org/pdf/cs/0401019.pdf. The most interesting item in that list would be the senses of organisms, as some of those might indeed involve processes that are…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/cs_0401019/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.OH</category></item></channel></rss>
