<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Encoding discrete quantum algebras in a hierarchy of binary words · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1806.01637/</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/1806.01637/feed.xml" rel="self" type="application/rss+xml" /><item><title>Encoding discrete quantum algebras in a hierarchy of binary words — mentioned by no_identd</title><link>https://news.ycombinator.com/item?id=17295787</link><guid isPermaLink="false">urn:hackerpapers:mention:1806.01637:17295787</guid><pubDate>Tue, 12 Jun 2018 17:44:08 GMT</pubDate><description>&lt;p&gt;Originally I wanted to make a point here about Interactive Computation, the strong Church-Turing hypothesis and persistent Turing Machines, however, while checking on the latest research in that area before doing so, I found the following paper: https://arxiv.org/abs/1702.06000 TE Raptis - &amp;#x27;Viral&amp;#x27; Turing Machines, Computation from Noise and Combinatorial Hierarchies Which gets cited by the following paper by the same author, which cites the OP paper(!), AND elaborates on it: https://arxiv.org/abs/1805.06301 TE Raptis - Finite Information Numbers through the Inductive Combinatorial Hierarchy…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1806.01637/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.GM</category></item></channel></rss>
