<?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/Complexity"><title>BibSonomy bookmarks for /user/a_olympia/Complexity</title><link>https://www.bibsonomy.org/user/a_olympia/Complexity</link><description>BibSonomy RSS Feed for /user/a_olympia/Complexity</description><items><rdf:Seq><rdf:li rdf:resource="http://jasss.soc.surrey.ac.uk/3/2/1.html"/><rdf:li rdf:resource="http://mathworld.wolfram.com/ComplexityTheory.html"/><rdf:li rdf:resource="http://www.readwriteweb.com/archives/ibm_many_eyes_after_one_month.php"/><rdf:li rdf:resource="http://www.opencyc.org/doc"/><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://jasss.soc.surrey.ac.uk/3/2/1.html"><title>Chris Goldspink: Modelling social systems as complex: Towards a social simulation meta-model</title><description>Modelling social systems</description><link>http://jasss.soc.surrey.ac.uk/3/2/1.html</link><dc:creator>a_olympia</dc:creator><dc:date>2008-04-05T09:06:06+02:00</dc:date><dc:subject>Modelling agent biological complexity environment handelbar society systems </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Modelling social systems&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Modelling"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/agent"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/biological"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/environment"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/handelbar"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/society"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/systems"/></rdf:Bag></taxo:topics></item><item rdf:about="http://mathworld.wolfram.com/ComplexityTheory.html"><title>Complexity Theory -- from Wolfram MathWorld</title><description></description><link>http://mathworld.wolfram.com/ComplexityTheory.html</link><dc:creator>a_olympia</dc:creator><dc:date>2007-09-11T09:12:54+02:00</dc:date><dc:subject>- Complexity Theory cs </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2007-09-11T09:12:54+02:00&#034; href=&#034;http://mathworld.wolfram.com/ComplexityTheory.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://mathworld.wolfram.com/ComplexityTheory.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/-"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Theory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cs"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.readwriteweb.com/archives/ibm_many_eyes_after_one_month.php"><title>IBM&#039;s Many Eyes App After One Month</title><description></description><link>http://www.readwriteweb.com/archives/ibm_many_eyes_after_one_month.php</link><dc:creator>a_olympia</dc:creator><dc:date>2007-03-09T10:01:41+01:00</dc:date><dc:subject>alphaworks article blog business collaboration community complexity data ibm information patterns research social visualization web2.0 </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2007-03-09T10:01:41+01:00&#034; href=&#034;http://www.readwriteweb.com/archives/ibm_many_eyes_after_one_month.php&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.readwriteweb.com/archives/ibm_many_eyes_after_one_month.php&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/alphaworks"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/article"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/blog"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/business"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/collaboration"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/community"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/data"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ibm"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/information"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/patterns"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/research"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/social"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/visualization"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/web2.0"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.opencyc.org/doc"><title>OpenCycgoogle kolmo</title><description></description><link>http://www.opencyc.org/doc</link><dc:creator>a_olympia</dc:creator><dc:date>2007-03-05T15:48:47+01:00</dc:date><dc:subject>coding complexity compression google kolmogorov </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2007-03-05T15:48:47+01:00&#034; href=&#034;http://www.opencyc.org/doc&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.opencyc.org/doc&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/coding"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/compression"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/google"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/kolmogorov"/></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>