<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>An aperiodic set of 11 Wang tiles · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1506.06492/</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/1506.06492/feed.xml" rel="self" type="application/rss+xml" /><item><title>An aperiodic set of 11 Wang tiles — mentioned by DonbunEf7</title><link>https://news.ycombinator.com/item?id=14747723</link><guid isPermaLink="false">urn:hackerpapers:mention:1506.06492:14747723</guid><pubDate>Tue, 11 Jul 2017 20:24:55 GMT</pubDate><description>&lt;p&gt;Wang tiles, mentioned only at the end of the article, encode Turing-equivalent computation in their simple color-matching rule. It is unknown exactly how useful Wang tiles are to theory of computation, other than as a wonderful demonstration of how easily Turing-complete systems arise naturally. I suspect that tiling may have applications in resource management, particularly when allocating resources like memory which have an underlying topological structure. Edit: https://arxiv.org/pdf/1506.06492.pdf is worth considering, but I don&amp;#x27;t yet know what its relevance is.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1506.06492/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DM</category></item></channel></rss>
