<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/user/a_olympia/Turing"><title>BibSonomy bookmarks for /user/a_olympia/Turing</title><link>https://www.bibsonomy.org/user/a_olympia/Turing</link><description>BibSonomy RSS Feed for /user/a_olympia/Turing</description><items><rdf:Seq><rdf:li rdf:resource="http://programming.reddit.com/goto?id=2ra78"/><rdf:li rdf:resource="http://www.edge.org/3rd_culture/dyson05/dyson05_index.html"/><rdf:li rdf:resource="http://search.arxiv.org:8081/paper.jsp?r=quant-ph/0605030&amp;qid=11719667032161br213.423nN-1230013087&amp;qs=%22kolmogorov+complexity%22+compression&amp;byDate=1"/></rdf:Seq></items></channel><item rdf:about="http://programming.reddit.com/goto?id=2ra78"><title>Binary Lambda Calculus and Combinatory Logic | What is the smalled turing machine that could be built?</title><description></description><link>http://programming.reddit.com/goto?id=2ra78</link><dc:creator>a_olympia</dc:creator><dc:date>2007-09-19T19:58:27+02:00</dc:date><dc:subject>Lambda ToRead turing </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2007-09-19T19:58:27+02:00&#034; href=&#034;http://programming.reddit.com/goto?id=2ra78&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://programming.reddit.com/goto?id=2ra78&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Lambda"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ToRead"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/turing"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.edge.org/3rd_culture/dyson05/dyson05_index.html"><title>Edge: TURING&#039;S CATHEDRAL by George Dyson</title><description></description><link>http://www.edge.org/3rd_culture/dyson05/dyson05_index.html</link><dc:creator>a_olympia</dc:creator><dc:date>2007-03-06T12:45:53+01:00</dc:date><dc:subject>academic ai archive article articles blog blogging blogs dyson google history science technology toread turing </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2007-03-06T12:45:53+01:00&#034; href=&#034;http://www.edge.org/3rd_culture/dyson05/dyson05_index.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.edge.org/3rd_culture/dyson05/dyson05_index.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/academic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ai"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/archive"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/article"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/articles"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/blog"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/blogging"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/blogs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/dyson"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/google"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/history"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/science"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/technology"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/toread"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/turing"/></rdf:Bag></taxo:topics></item><item rdf:about="http://search.arxiv.org:8081/paper.jsp?r=quant-ph/0605030&amp;qid=11719667032161br213.423nN-1230013087&amp;qs=%22kolmogorov+complexity%22+compression&amp;byDate=1"><title>[quant-ph/0605030] Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity</title><description>Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity Authors: Markus Mueller Comments: 17 pages, 1 figure. Changed layout (2 columns), corrected typos Subj-class: Quantum Physics; Mathematical Physics; Information Theory</description><link>http://search.arxiv.org:8081/paper.jsp?r=quant-ph/0605030&amp;qid=11719667032161br213.423nN-1230013087&amp;qs=%22kolmogorov+complexity%22+compression&amp;byDate=1</link><dc:creator>a_olympia</dc:creator><dc:date>2007-02-20T11:16:30+01:00</dc:date><dc:subject>Complexity Kolmogorov Machines Quantum Turing </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity Authors: Markus Mueller Comments: 17 pages, 1 figure. Changed layout (2 columns), corrected typos Subj-class: Quantum Physics; Mathematical Physics; Information Theory&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Kolmogorov"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Machines"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Quantum"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Turing"/></rdf:Bag></taxo:topics></item></rdf:RDF>