<?xml version="1.0" encoding="UTF-8"?>
 <rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:cc="http://web.resource.org/cc/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:admin="http://webns.net/mvcb/">
  <channel rdf:about="http://pinboard.in">
    <title>Pinboard (tlockney)</title>
    <link>https://pinboard.in/u:tlockney/public/</link>
    <description>recent bookmarks from tlockney</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="http://limist.com/coding/paper-notes-out-of-the-tar-pit-moseley-and-marks-2006.html"/>
	<rdf:li rdf:resource="http://www.complexityexplorer.org/"/>
	<rdf:li rdf:resource="http://events.inf.ed.ac.uk/Milner2012/Monday_Panel-html5-mp4-large.html"/>
	<rdf:li rdf:resource="http://www.allthingsdistributed.com/2012/07/on-system-simplicity.html"/>
	<rdf:li rdf:resource="http://jeremykun.wordpress.com/2012/04/21/kolmogorov-complexity-a-primer/"/>
	<rdf:li rdf:resource="http://homepages.cwi.nl/~tromp/cl/cl.html"/>
	<rdf:li rdf:resource="http://stellar.mit.edu/S/course/6/sp11/6.045/"/>
	<rdf:li rdf:resource="http://www.nature-of-computation.org/"/>
	<rdf:li rdf:resource="http://www.cs.princeton.edu/theory/complexity/"/>
	<rdf:li rdf:resource="https://stellar.mit.edu/S/course/6/fa11/6.893/index.html"/>
	<rdf:li rdf:resource="http://blog.fogus.me/2011/09/02/scala-is-for-drivers/"/>
	<rdf:li rdf:resource="http://www.us.oup.com/us/catalog/general/subject/Physics/Mathematicalphysics/?view=usa&amp;ci=9780199233212"/>
	<rdf:li rdf:resource="http://en.m.wikipedia.org/wiki/Kolmogorov_complexity"/>
	<rdf:li rdf:resource="http://rjlipton.wordpress.com/2010/08/08/a-proof-that-p-is-not-equal-to-np/"/>
	<rdf:li rdf:resource="http://www.santafe.edu/library/foundational-papers-complexity-science/"/>
	<rdf:li rdf:resource="http://www.kitchensoap.com/2009/11/12/how-complex-systems-fail-a-webops-perspective/"/>
	<rdf:li rdf:resource="http://www.math.uic.edu/~culler/chaos/"/>
	<rdf:li rdf:resource="http://www.cs.princeton.edu/theory/index.php/Compbook/Draft"/>
	<rdf:li rdf:resource="http://www.kk.org/outofcontrol/index.php"/>
	<rdf:li rdf:resource="http://cs.gmu.edu/~eclab/projects/mason/"/>
	<rdf:li rdf:resource="http://necsi.org/publications/dcs/index.html"/>
	<rdf:li rdf:resource="http://www.cs.cornell.edu/Courses/cs685/2007fa/"/>
	<rdf:li rdf:resource="http://www.santafe.edu/sfi/publications/Bulletins/index.html"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="http://limist.com/coding/paper-notes-out-of-the-tar-pit-moseley-and-marks-2006.html">
    <title>Paper notes: Out of the Tar Pit, Moseley and Marks 2006</title>
    <dc:date>2013-05-27T22:44:59+00:00</dc:date>
    <link>http://limist.com/coding/paper-notes-out-of-the-tar-pit-moseley-and-marks-2006.html</link>
    <dc:creator>tlockney</dc:creator><dc:subject>complexity programming relational</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:tlockney/b:b6226cd067cd/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:relational"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.complexityexplorer.org/">
    <title>Complexity Explorer</title>
    <dc:date>2013-02-05T17:24:10+00:00</dc:date>
    <link>http://www.complexityexplorer.org/</link>
    <dc:creator>tlockney</dc:creator><dc:subject>complexity santafeinstitute</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:tlockney/b:8dfbfd0b3e11/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:santafeinstitute"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://events.inf.ed.ac.uk/Milner2012/Monday_Panel-html5-mp4-large.html">
    <title>Milner Symposium 2012</title>
    <dc:date>2012-10-18T22:37:36+00:00</dc:date>
    <link>http://events.inf.ed.ac.uk/Milner2012/Monday_Panel-html5-mp4-large.html</link>
    <dc:creator>tlockney</dc:creator><dc:subject>computation automata computability complexity fsm</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:tlockney/b:9fe4d9f27f38/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:computation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:automata"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:computability"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:fsm"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.allthingsdistributed.com/2012/07/on-system-simplicity.html">
    <title>Back-to-Basics Weekend Reading - On Systems Simplicity - All Things Distributed</title>
    <dc:date>2012-07-28T17:18:56+00:00</dc:date>
    <link>http://www.allthingsdistributed.com/2012/07/on-system-simplicity.html</link>
    <dc:creator>tlockney</dc:creator><dc:subject>systems simplicity complexity</dc:subject>
<dc:identifier>https://pinboard.in/u:tlockney/b:a8e5e4884c47/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:simplicity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexity"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://jeremykun.wordpress.com/2012/04/21/kolmogorov-complexity-a-primer/">
    <title>Kolmogorov Complexity – A Primer | Math ∩ Programming</title>
    <dc:date>2012-04-27T21:32:51+00:00</dc:date>
    <link>http://jeremykun.wordpress.com/2012/04/21/kolmogorov-complexity-a-primer/</link>
    <dc:creator>tlockney</dc:creator><dc:subject>algorithms complexity</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:tlockney/b:52354f8c5b1b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexity"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://homepages.cwi.nl/~tromp/cl/cl.html">
    <title>John's Combinatory Logic Playground</title>
    <dc:date>2012-01-01T09:09:34+00:00</dc:date>
    <link>http://homepages.cwi.nl/~tromp/cl/cl.html</link>
    <dc:creator>tlockney</dc:creator><dc:subject>haskell lambda complexity</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:tlockney/b:f4f8f9294499/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:haskell"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:lambda"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexity"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://stellar.mit.edu/S/course/6/sp11/6.045/">
    <title>6.045/18.400 Class Home</title>
    <dc:date>2011-09-07T05:05:57+00:00</dc:date>
    <link>http://stellar.mit.edu/S/course/6/sp11/6.045/</link>
    <dc:creator>tlockney</dc:creator><dc:subject>automata complexity computation</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:tlockney/b:ef52e6a226c8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:automata"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:computation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.nature-of-computation.org/">
    <title>Nature of Computation</title>
    <dc:date>2011-09-07T05:02:46+00:00</dc:date>
    <link>http://www.nature-of-computation.org/</link>
    <dc:creator>tlockney</dc:creator><dc:subject>complexity computation</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:tlockney/b:6355e557e47b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:computation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.princeton.edu/theory/complexity/">
    <title>Computational Complexity: A Modern Approach / Sanjeev Arora and Boaz Barak</title>
    <dc:date>2011-09-07T04:43:10+00:00</dc:date>
    <link>http://www.cs.princeton.edu/theory/complexity/</link>
    <dc:creator>tlockney</dc:creator><dc:subject>algorithms complexity cs theory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:tlockney/b:330dfd559137/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:cs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:theory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://stellar.mit.edu/S/course/6/fa11/6.893/index.html">
    <title>6.893 Class Home</title>
    <dc:date>2011-09-07T04:19:02+00:00</dc:date>
    <link>https://stellar.mit.edu/S/course/6/fa11/6.893/index.html</link>
    <dc:creator>tlockney</dc:creator><dc:subject>reading math complexity philosophy computing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:tlockney/b:4c84f0c964b2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:reading"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:math"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:philosophy"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:computing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://blog.fogus.me/2011/09/02/scala-is-for-drivers/">
    <title>-= Scala is for drivers =-</title>
    <dc:date>2011-09-02T14:38:07+00:00</dc:date>
    <link>http://blog.fogus.me/2011/09/02/scala-is-for-drivers/</link>
    <dc:creator>tlockney</dc:creator><description><![CDATA[Emblogginated: "Scala is for drivers"    #scala #complexity]]></description>
<dc:subject>complexity scala</dc:subject>
<dc:source>https://twitter.com/</dc:source>
<dc:identifier>https://pinboard.in/u:tlockney/b:47902a9d5efa/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:scala"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.us.oup.com/us/catalog/general/subject/Physics/Mathematicalphysics/?view=usa&amp;ci=9780199233212">
    <title>Oxford University Press: The Nature of Computation: Cristopher Moore</title>
    <dc:date>2011-08-12T23:29:13+00:00</dc:date>
    <link>http://www.us.oup.com/us/catalog/general/subject/Physics/Mathematicalphysics/?view=usa&amp;ci=9780199233212</link>
    <dc:creator>tlockney</dc:creator><dc:subject>computation complexity</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:tlockney/b:91cadc5eb398/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:computation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexity"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://en.m.wikipedia.org/wiki/Kolmogorov_complexity">
    <title>Kolmogorov complexity</title>
    <dc:date>2011-05-05T22:22:15+00:00</dc:date>
    <link>http://en.m.wikipedia.org/wiki/Kolmogorov_complexity</link>
    <dc:creator>tlockney</dc:creator><dc:subject>Informationtheory complexity</dc:subject>
<dc:identifier>https://pinboard.in/u:tlockney/b:f53efa1896ce/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:Informationtheory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexity"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://rjlipton.wordpress.com/2010/08/08/a-proof-that-p-is-not-equal-to-np/">
    <title>A Proof That P Is Not Equal To NP? « Gödel’s Lost Letter and P=NP</title>
    <dc:date>2010-08-09T05:28:35+00:00</dc:date>
    <link>http://rjlipton.wordpress.com/2010/08/08/a-proof-that-p-is-not-equal-to-np/</link>
    <dc:creator>tlockney</dc:creator><dc:subject>complexity p!=np</dc:subject>
<dc:identifier>https://pinboard.in/u:tlockney/b:b30f0b442950/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:p!=np"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.santafe.edu/library/foundational-papers-complexity-science/">
    <title>Foundational Papers in Complexity Science | Santa Fe Institute</title>
    <dc:date>2010-03-07T17:08:54+00:00</dc:date>
    <link>http://www.santafe.edu/library/foundational-papers-complexity-science/</link>
    <dc:creator>tlockney</dc:creator><dc:subject>santafeinstitute complexity systems</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:tlockney/b:1867e8bdbf5f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:santafeinstitute"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:systems"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.kitchensoap.com/2009/11/12/how-complex-systems-fail-a-webops-perspective/">
    <title>How Complex Systems Fail: A WebOps Perspective</title>
    <dc:date>2009-11-15T08:08:22+00:00</dc:date>
    <link>http://www.kitchensoap.com/2009/11/12/how-complex-systems-fail-a-webops-perspective/</link>
    <dc:creator>tlockney</dc:creator><dc:subject>operations complexity systems sysadmin</dc:subject>
<dc:identifier>https://pinboard.in/u:tlockney/b:da016ab96a13/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:operations"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:sysadmin"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.math.uic.edu/~culler/chaos/">
    <title>Chaos, Fractals and Complex Dynamics</title>
    <dc:date>2009-09-10T00:14:21+00:00</dc:date>
    <link>http://www.math.uic.edu/~culler/chaos/</link>
    <dc:creator>tlockney</dc:creator><dc:subject>python chaos complexity dorkbotpdx fractal math</dc:subject>
<dc:identifier>https://pinboard.in/u:tlockney/b:66d4592bd980/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:python"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:chaos"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:dorkbotpdx"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:fractal"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:math"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.princeton.edu/theory/index.php/Compbook/Draft">
    <title>CS Theory @ Princeton : Draft browse</title>
    <dc:date>2009-09-07T05:34:28+00:00</dc:date>
    <link>http://www.cs.princeton.edu/theory/index.php/Compbook/Draft</link>
    <dc:creator>tlockney</dc:creator><dc:subject>complexity algorithms cs</dc:subject>
<dc:identifier>https://pinboard.in/u:tlockney/b:ff5b02a5b5e9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:cs"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.kk.org/outofcontrol/index.php">
    <title>Kevin Kelly -- Out of Control</title>
    <dc:date>2008-06-14T07:06:18+00:00</dc:date>
    <link>http://www.kk.org/outofcontrol/index.php</link>
    <dc:creator>tlockney</dc:creator><description><![CDATA["Out of Control is a summary of what we know about self-sustaining systems, both living ones such as a tropical wetland, or an artificial one, such as a computer simulation of our planet."
]]></description>
<dc:subject>community collective complexity culture technology social</dc:subject>
<dc:identifier>https://pinboard.in/u:tlockney/b:ae57f694a163/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:community"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:collective"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:culture"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:technology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:social"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://cs.gmu.edu/~eclab/projects/mason/">
    <title>MASON Multiagent Simulation Toolkit</title>
    <dc:date>2008-04-24T21:46:24+00:00</dc:date>
    <link>http://cs.gmu.edu/~eclab/projects/mason/</link>
    <dc:creator>tlockney</dc:creator><dc:subject>mason simulation complexity java graphics</dc:subject>
<dc:identifier>https://pinboard.in/u:tlockney/b:9c9a15f8210c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:mason"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:java"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:graphics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://necsi.org/publications/dcs/index.html">
    <title>Dynamics of Complex Systems</title>
    <dc:date>2008-02-21T03:17:15+00:00</dc:date>
    <link>http://necsi.org/publications/dcs/index.html</link>
    <dc:creator>tlockney</dc:creator><dc:subject>complexity physics science math</dc:subject>
<dc:identifier>https://pinboard.in/u:tlockney/b:c6e1270d9c37/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:physics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:math"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.cornell.edu/Courses/cs685/2007fa/">
    <title>The Structure of Information Networks (Jon Kleinberg)</title>
    <dc:date>2007-09-01T18:21:59+00:00</dc:date>
    <link>http://www.cs.cornell.edu/Courses/cs685/2007fa/</link>
    <dc:creator>tlockney</dc:creator><dc:subject>complexity information toread networks cs education</dc:subject>
<dc:identifier>https://pinboard.in/u:tlockney/b:efb3a4d844cc/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:information"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:toread"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:cs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:education"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.santafe.edu/sfi/publications/Bulletins/index.html">
    <title>Santa Fe Institute Bulletin</title>
    <dc:date>2004-09-29T19:50:09+00:00</dc:date>
    <link>http://www.santafe.edu/sfi/publications/Bulletins/index.html</link>
    <dc:creator>tlockney</dc:creator><dc:subject>complexity santafeinstitute complexsystems systems</dc:subject>
<dc:identifier>https://pinboard.in/u:tlockney/b:2c4b5f4ae2aa/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:santafeinstitute"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:complexsystems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:tlockney/t:systems"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>