<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
     xmlns:admin="http://webns.net/mvcb/"
     xmlns:content="http://purl.org/rss/1.0/modules/content/"
     xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
	<channel>
	<title>MetaFilter posts tagged with ComputerScience</title>
	<link>http://www.metafilter.com/tags/ComputerScience</link>
	<description>Posts tagged with 'ComputerScience' at MetaFilter.</description>
	<pubDate>Wed, 19 Aug 2009 20:36:55 -0800</pubDate> <lastBuildDate>Wed, 19 Aug 2009 20:36:55 -0800</lastBuildDate>

	<language>en-us</language>
	<docs>http://blogs.law.harvard.edu/tech/rss</docs>
	<ttl>60</ttl>
	<item>
		<title>Asking for an apology.</title>
		<link>http://www.metafilter.com/84299/Asking%2Dfor%2Dan%2Dapology</link>
		<description>&lt;a href="http://www.independent.co.uk/news/people/news/dawkins-calls-for-official-apology-for-turing-1774033.html"&gt;Alan Turing&lt;/a&gt; , one of the men &lt;a href=&quot;http://www.turing.org.uk/turing/&quot;&gt;responsible for computers&lt;/a&gt; as we know them today, was &lt;a href=&quot;http://www.jgc.org/blog/2009/06/turing-test-and-prejudice.html&quot;&gt;persecuted by the British government&lt;/a&gt; &lt;a href=&quot;http://www.myhero.com/myhero/hero.asp?hero=Turing&quot;&gt;for being a homosexual&lt;/a&gt;. &lt;a href=&quot;http://richarddawkins.net/&quot;&gt;Richard Dawkins&lt;/a&gt; and &lt;a href=&quot;http://www.jgc.org/&quot;&gt;John Graham-Cumming&lt;/a&gt; &lt;a href=&quot;http://petitions.number10.gov.uk/turing/&quot;&gt;want the British government to formally apologize&lt;/a&gt;. </description>
		<guid isPermaLink="false">tag:metafilter.com,2009:site.84299</guid>
		<pubDate>Wed, 19 Aug 2009 20:36:55 -0800</pubDate>
		<category>alanturing</category>
		<category>computerscience</category>
		<category>dawkins</category>
		<category>grahamcumming</category>
		<category>homosexual</category>
		<category>johngrahamcumming</category>
		<category>petition</category>
		<category>richarddawkins</category>
		<category>suicide</category>
		<category>turing</category>
		<dc:creator>idiopath</dc:creator>
	</item>
      <item>
		<title>The On-Line Encyclopedia of Integer Sequences</title>
		<link>http://www.metafilter.com/79841/The%2DOnLine%2DEncyclopedia%2Dof%2DInteger%2DSequences</link>
		<description> Ever wondered what comes next, and why? The &lt;a href=&quot;http://www.research.att.com/~njas/sequences/&quot;&gt;On-Line Encyclopedia of Integer Sequences&lt;/a&gt; has the answers. &lt;small&gt;(&lt;a href=&quot;http://www.metafilter.com/16382/&quot;&gt;Previously&lt;/a&gt;.)&lt;/small&gt;  </description>
		<guid isPermaLink="false">tag:metafilter.com,2009:site.79841</guid>
		<pubDate>Tue, 10 Mar 2009 10:37:33 -0800</pubDate>
		<category>combinatorics</category>
		<category>computerscience</category>
		<category>database</category>
		<category>encyclopedia</category>
		<category>math</category>
		<category>mathematics</category>
		<category>sequences</category>
		<category>series</category>
		<category>useful</category>
		<dc:creator>parudox</dc:creator>
	</item>
      <item>
		<title>The Price of Anarchy</title>
		<link>http://www.metafilter.com/77773/The%2DPrice%2Dof%2DAnarchy</link>
		<description> &lt;a href=&quot;http://features.csmonitor.com/environment/2008/10/06/does-closing-roads-cut-delays/&quot;&gt;Braess&apos; paradox&lt;/a&gt; and the &lt;a href=&quot;http://www.siam.org/pdf/news/232.pdf&quot;&gt;price of anarchy&lt;/a&gt; &lt;small&gt;[PDF]&lt;/small&gt;: &quot;We had three tunnels in the city and one needed to be &lt;a href=&quot;http://www.guardian.co.uk/environment/2006/nov/01/society.travelsenvironmentalimpact&quot;&gt;shut down&lt;/a&gt;. Bizarrely, we found that car volumes dropped. ... We discovered it was a case of Braess&apos; paradox, which says that by taking away space in an urban area you can actually &lt;a href=&quot;http://query.nytimes.com/gst/fullpage.html?res=9C0CE7D81530F936A15751C1A966958260&amp;scp=8&amp;sq=&amp;st=nyt&quot;&gt;increase the flow of traffic&lt;/a&gt;, and, by implication, by adding extra capacity to a road network you can &lt;a href=&quot;http://www.nointrigue.com/blog/2007/09/07/on-braess-paradox-and-non-increasing-cost-functions/&quot;&gt;reduce overall performance&lt;/a&gt;.&quot; &lt;a href=&quot;http://arxiv.org/abs/0712.1598&quot;&gt;The Price of Anarchy in Transportation Networks&lt;/a&gt; is the paper mentioned in the first link &#8212; see that for maps of Boston, London, and Manhattan that show which roads were beneficial to block (individually) in a simulation. If you are interested in selfish networks and are not afraid of math, check out &lt;a href=&quot;http://www.amazon.com/exec/obidos/ASIN/0262182432/metafilter-20/ref=nosim/&quot;&gt;Selfish Routing and the Price of Anarchy&lt;/a&gt; (&lt;a href=&quot;http://www.americanscientist.org/bookshelf/pub/coping-with-selfishness&quot;&gt;review&lt;/a&gt;) as well as &lt;a href=&quot;http://theory.stanford.edu/~tim/papers/routing.pdf&quot;&gt;this paper&lt;/a&gt; for some bounds on the price of anarchy. </description>
		<guid isPermaLink="false">tag:metafilter.com,2008:site.77773</guid>
		<pubDate>Sat, 27 Dec 2008 23:23:01 -0800</pubDate>
		<category>anarchy</category>
		<category>braessparadox</category>
		<category>computerscience</category>
		<category>counterintuitive</category>
		<category>economics</category>
		<category>gametheory</category>
		<category>networks</category>
		<category>paradox</category>
		<category>priceofanarchy</category>
		<category>prisonersdilemma</category>
		<category>selfishness</category>
		<category>traffic</category>
		<category>urbanplanning</category>
		<dc:creator>parudox</dc:creator>
	</item>
      <item>
		<title>Malcolm Gladwell on genius</title>
		<link>http://www.metafilter.com/76572/Malcom%2DGladwell%2Don%2Dgenius</link>
		<description>&lt;a href="http://www.guardian.co.uk/books/2008/nov/15/malcolm-gladwell-outliers-extract"&gt;Malcolm Gladwell asks:&lt;/a&gt; is there such a thing as pure genius? An essay (in fact, a book extract) on the how genius seems to very often be a combination of (a) some base level of ability, (b) lots and lots of practice, and (c) luck and circumstance. Rings true from the perspective of this mathematician, at least. &lt;small&gt;&lt;a href=&quot;http://popurls.com/&quot;&gt;Via&lt;/a&gt;&lt;/small&gt;. </description>
		<guid isPermaLink="false">tag:metafilter.com,2008:site.76572</guid>
		<pubDate>Sat, 15 Nov 2008 17:42:11 -0800</pubDate>
		<category>computerscience</category>
		<category>genius</category>
		<category>malcolmgladwell</category>
		<category>malcomgladwell</category>
		<dc:creator>louigi</dc:creator>
	</item>
      <item>
		<title>Computer science doesn&apos;t require a computer</title>
		<link>http://www.metafilter.com/70695/Computer%2Dscience%2Ddoesnt%2Drequire%2Da%2Dcomputer</link>
		<description> Learn (or teach) fundamentals of computer science, &lt;a href=&apos;http://csunplugged.com/index.php/activities.html&apos;&gt;without a computer&lt;/a&gt;. Provided as hands-on exercises suitable for children, or even CS-illiterate adults. (If this is too basic for you, &lt;a href=&apos;http://scpd.stanford.edu/scpd/students/Dam_ui/pages/ArchivedVideoList56K.asp?Include=musings&apos;&gt;go here&lt;/a&gt;.)  </description>
		<guid isPermaLink="false">tag:metafilter.com,2008:site.70695</guid>
		<pubDate>Thu, 10 Apr 2008 00:12:13 -0800</pubDate>
		<category>computerScience</category>
		<category>education</category>
		<dc:creator>orthogonality</dc:creator>
	</item>
      <item>
		<title>Big book of algorithms</title>
		<link>http://www.metafilter.com/69625/Big%2Dbook%2Dof%2Dalgorithms</link>
		<description> If you could use a great big free handbook of discrete math and algorithms, J&amp;#0246;rg Arndt&apos;s &lt;a href=&quot;http://www.jjj.de/fxt/#fxtbook&quot;&gt;fxtbook&lt;/a&gt; wants to be your friend.  Plain text &lt;a href=&quot;http://www.jjj.de/fxt/fxtbook-toc.txt&quot;&gt;table of contents&lt;/a&gt; to whet your appetite.  </description>
		<guid isPermaLink="false">tag:metafilter.com,2008:site.69625</guid>
		<pubDate>Wed, 05 Mar 2008 07:02:22 -0800</pubDate>
		<category>algorithms</category>
		<category>combinatorics</category>
		<category>computerscience</category>
		<category>discrete</category>
		<category>fxtbook</category>
		<category>jorgarndt</category>
		<category>math</category>
		<category>programming</category>
		<dc:creator>Wolfdog</dc:creator>
	</item>
      <item>
		<title>&quot;That half-destroyed paperwork is a tantalizing secret.&quot;</title>
		<link>http://www.metafilter.com/68636/That%2Dhalfdestroyed%2Dpaperwork%2Dis%2Da%2Dtantalizing%2Dsecret</link>
		<description> &lt;a href=&quot;http://www.wired.com/politics/security/magazine/16-02/ff_stasi&quot;&gt;&quot;That half-destroyed paperwork is a tantalizing secret.&quot;&lt;/a&gt; &lt;i&gt;The Stasi fostered a pervasive and justified paranoia. And it generated an almost inconceivable amount of paper, enough to fill more than 100 miles of shelves. The agency indexed and cross-referenced 5.6 million names in its central card catalog alone. Hundreds of thousands of &quot;unofficial employees&quot; snitched on friends, coworkers, and their own spouses, sometimes because they&apos;d been extorted and sometimes in exchange for money, promotions, or permission to travel abroad.&lt;/i&gt; After the fall of the Berlin Wall, the Stasi tried to destroy its records. Now, with the help of computer science, the &lt;a href=&quot;http://www.wired.com/politics/security/multimedia/2008/01/ff_stasi_ss&quot;&gt;&quot;billion-piece puzzle&quot;&lt;/a&gt; is finally coming together. &lt;small&gt;The article is an interesting update on the one featured in &lt;a href=&quot;http://www.metafilter.com/29662/Recovering-the-files-of-the-Stasi&quot;&gt;this 2003 Metafilter post &lt;/a&gt;.&lt;/small&gt; Related:

&lt;a href=&quot;http://www.stasimuseum.de/en/enindex.htm&quot;&gt;The Stasi Museum&lt;/a&gt; in Berlin

&lt;a href=&quot;http://www.myspystory.com/intro.html&quot;&gt;If It Had Not Been For 15 Minutes&lt;/a&gt; (an incredible defection story) </description>
		<guid isPermaLink="false">tag:metafilter.com,2008:site.68636</guid>
		<pubDate>Wed, 30 Jan 2008 07:42:54 -0800</pubDate>
		<category>computerscience</category>
		<category>eastgermany</category>
		<category>secretpolice</category>
		<category>stasi</category>
		<dc:creator>amyms</dc:creator>
	</item>
      <item>
		<title>Pixar&apos;s papers on computer graphics</title>
		<link>http://www.metafilter.com/68512/Pixars%2Dpapers%2Don%2Dcomputer%2Dgraphics</link>
		<description>&lt;a href="http://graphics.pixar.com/"&gt;1982-2007&lt;/a&gt; Pixar&apos;s papers on computer graphics  </description>
		<guid isPermaLink="false">tag:metafilter.com,2008:site.68512</guid>
		<pubDate>Fri, 25 Jan 2008 21:39:14 -0800</pubDate>
		<category>3d</category>
		<category>animation</category>
		<category>cg</category>
		<category>computeranimation</category>
		<category>computerscience</category>
		<category>pixar</category>
		<dc:creator>brundlefly</dc:creator>
	</item>
      <item>
		<title>Computing In Dark Rooms</title>
		<link>http://www.metafilter.com/67479/Computing%2DIn%2DDark%2DRooms</link>
		<description> Courtesy of &lt;a href=&quot;http://www.mentegrafica.it/blog/&quot;&gt;Daniele Gallifa&apos;s Mentegrafica&lt;/a&gt;, a &lt;a href=&quot;http://www.mentegrafica.it/blog/2007/12/14/hand-held-information-spaces/&quot;&gt;video demonstration&lt;/a&gt; of &lt;a href=&quot;http://www.dgp.toronto.edu/~ravin/papers/uist2007_multiuserhandheldprojector.pdf&quot;&gt;&lt;i&gt;Multi-User Interaction using Handheld Projectors&lt;/i&gt;&lt;/a&gt;. An update to the classic &lt;a href=&quot;http://www.samstoybox.com/toys/Miscellaneous.html&quot;&gt;Ghostbusters toy&lt;/a&gt;, this set of position-aware hand held projectors lets users share information by shining light onto walls. Some of the smart details in the video include: sharing calendars by overlapping light from two projectors, adjoining projections to create larger screens, and blurring private information when outsiders are nearby. No mention of applicability to first person shooters.  </description>
		<guid isPermaLink="false">tag:metafilter.com,2007:site.67479</guid>
		<pubDate>Sat, 15 Dec 2007 19:01:54 -0800</pubDate>
		<category>computerscience</category>
		<category>design</category>
		<category>ghostbusters</category>
		<category>handheld</category>
		<category>hci</category>
		<category>projector</category>
		<category>universityoftoronto</category>
		<dc:creator>migurski</dc:creator>
	</item>
      <item>
		<title>Gerrymandered</title>
		<link>http://www.metafilter.com/63093/Gerrymandered</link>
		<description>&lt;a href="http://www.rangevoting.org/GerryExamples.html"&gt;The shortest-splitline algorithm for drawing N congressional districts.&lt;/a&gt; You can seee examples of their unbiased district-drawing algorithm in action compared with the gerrymandered districts drawn by politicians.  </description>
		<guid isPermaLink="false">tag:metafilter.com,2007:site.63093</guid>
		<pubDate>Fri, 20 Jul 2007 06:23:31 -0800</pubDate>
		<category>Algorithms</category>
		<category>ComputerScience</category>
		<category>gerrymandering</category>
		<category>SplittingLineAlgorithm</category>
		<dc:creator>chunking express</dc:creator>
	</item>
      <item>
		<title>Jeff Hawkins unleashes his brain: Numenta&apos;s new AI platform</title>
		<link>http://www.metafilter.com/60005/Jeff%2DHawkins%2Dunleashes%2Dhis%2Dbrain%2DNumentas%2Dnew%2DAI%2Dplatform</link>
		<description>&lt;a href="http://en.wikipedia.org/wiki/Jeff_Hawkins"&gt;Jeff Hawkins,&lt;/a&gt; co-founder of &lt;a href=&quot;http://www.palm.com/&quot;&gt;Palm&lt;/a&gt; and Handspring, has started a new company, called &lt;a href=&quot;http://www.numenta.com/&quot;&gt;Numenta&lt;/a&gt;, to test his &lt;a href=&quot;http://en.wikipedia.org/wiki/On_Intelligence&quot;&gt;controversial theory&lt;/a&gt; of intelligence. Whether you find his theory plausible or not, his &lt;a href=&quot;http://www.amazon.com/exec/obidos/ASIN/0805078533/metafilter-20/ref=nosim/&quot;&gt;book&lt;/a&gt;, &quot;&lt;a href=&quot;http://www.onintelligence.org/&quot;&gt;On Intelligence&lt;/a&gt;&quot; is fascinating. Numenta is attempting to build A.I.s using Hawkins&apos; theory as a backbone. They&apos;ve developed a software engine and a &lt;a href=&quot;http://www.python.org/doc/Summary.html&quot;&gt;Python&lt;/a&gt;-based API, which they&apos;ve made public (&lt;a href=&quot;http://www.numenta.com/for-developers/software.php&quot;&gt;as free downloads&lt;/a&gt;), so that hackers can start playing. They&apos;ve also released &lt;a href=&quot;http://www.numenta.com/for-developers/education.php&quot;&gt;manuals&lt;/a&gt;, &lt;a href=&quot;http://www.numenta.com/Numenta_HTM_Concepts.pdf&quot;&gt;a whitepaper&lt;/a&gt; (pdf) and videos [&lt;a href=&quot;http://www.numenta.com/for-developers/education/general-overview-htm.php&quot;&gt;1&lt;/a&gt;] [&lt;a href=&quot;http://www.numenta.com/for-developers/education/technical-overview-htm.php&quot;&gt;2&lt;/a&gt;]. (At about 30:18 into the first video, Hawkins demonstrates, with screenshots, the first app which uses his system.)  </description>
		<guid isPermaLink="false">tag:metafilter.com,2007:site.60005</guid>
		<pubDate>Wed, 04 Apr 2007 13:35:42 -0800</pubDate>
		<category>ai</category>
		<category>artificialintelligence</category>
		<category>cognitivescience</category>
		<category>compsci</category>
		<category>computerscience</category>
		<category>hawkins</category>
		<category>intelligence</category>
		<category>jeffhawkins</category>
		<category>neurology</category>
		<category>numenta</category>
		<category>onintelligence</category>
		<category>programming</category>
		<category>psychology</category>
		<dc:creator>grumblebee</dc:creator>
	</item>
      <item>
		<title>Online topics in computer science research and engineering</title>
		<link>http://www.metafilter.com/53967/Online%2Dtopics%2Din%2Dcomputer%2Dscience%2Dresearch%2Dand%2Dengineering</link>
		<description> The &lt;a href=&quot;http://www.cs.washington.edu/news/colloq.info.html&quot; title=&quot;UW CSE Colloquium and Televised Talk Information&quot;&gt;University of Washington CSE Colloquium&lt;/a&gt; features accessible talks by leading computer scientists and computer engineers from the &lt;a href=&quot;http://www.cs.washington.edu/info/aboutus/&quot; title=&quot;About the University of Washington&quot;&gt;University of Washington&lt;/a&gt;, the region, the nation, and the world, most of which are &lt;a href=&quot;http://norfolk.cs.washington.edu/htbin-post/unrestricted/colloq/search.cgi&quot; title=&quot;Colloquia Access System: Choose a start and end date, check the &apos;Archive&apos; checkbox, and search!&quot;&gt;available as MP3 audio and/or Real/Windows Media video online for free&lt;/a&gt;. Personal favorites include talks on &lt;a href=&quot;http://norfolk.cs.washington.edu/htbin-post/unrestricted/colloq/details.cgi?id=498&quot; title=&quot;Towards Robust and Powerful Quantum Computers - David Bacon (UW CSE)&quot;&gt;quantum computing&lt;/a&gt;, &lt;a href=&quot;http://norfolk.cs.washington.edu/htbin-post/unrestricted/colloq/details.cgi?id=449&quot; title=&quot;Computing structural biology - David Baker (UW Biochemistry)&quot;&gt;&lt;i&gt;de novo&lt;/i&gt; protein design&lt;/a&gt;, and &lt;a href=&quot;http://norfolk.cs.washington.edu/htbin-post/unrestricted/colloq/details.cgi?id=241&quot; title=&quot;Rich Probabilistic Models for Genomic Data - Eran Segal (Stanford University)&quot;&gt;&lt;i&gt;in silico&lt;/i&gt; biology as a smarter way to learn how our genes work&lt;/a&gt;.  </description>
		<guid isPermaLink="false">tag:metafilter.com,2006:site.53967</guid>
		<pubDate>Thu, 17 Aug 2006 06:57:24 -0800</pubDate>
		<category>biology</category>
		<category>colloquia</category>
		<category>computationalbiology</category>
		<category>computer</category>
		<category>computerscience</category>
		<category>cse</category>
		<category>distancelearning</category>
		<category>education</category>
		<category>uw</category>
		<category>washington</category>
		<dc:creator>Blazecock Pileon</dc:creator>
	</item>
      <item>
		<title>Who can name the bigger number?</title>
		<link>http://www.metafilter.com/50105/Who%2Dcan%2Dname%2Dthe%2Dbigger%2Dnumber</link>
		<description>&lt;a href="http://www.scottaaronson.com/writings/bignumbers.html"&gt;Who can name the bigger number?&lt;/a&gt; I guarantee you will lose to the Busy Beavers. (No, infinity is not allowed, the bigger infinity is a &lt;a href=&quot;http://en.wikipedia.org/wiki/Aleph_number&quot;&gt;different game.&lt;/a&gt;) The author also &lt;a href=&quot;http://www.scottaaronson.com/blog/2006/02/lord-send-no-sign.html&quot;&gt;debunks&lt;/a&gt; in very simple terms the recent story that quantum computers perform calculations &lt;a href=&quot;http://www.news.uiuc.edu/news/06/0222quantum.html&quot;&gt;without being turned on&lt;/a&gt;. My first post and disclaimer: I know the author from our mutual field of &lt;a href=&quot;http://www.cs.caltech.edu/~westside/quantum-intro.html&quot;&gt;quantum information&lt;/a&gt;.  </description>
		<guid isPermaLink="false">tag:metafilter.com,2006:site.50105</guid>
		<pubDate>Thu, 16 Mar 2006 00:16:49 -0800</pubDate>
		<category>computerscience</category>
		<category>informationtheory</category>
		<category>math</category>
		<category>numbertheory</category>
		<category>quantum</category>
		<dc:creator>gregv</dc:creator>
	</item>
      <item>
		<title>Intelligent Design by Trial and Error</title>
		<link>http://www.metafilter.com/44585/Intelligent%2DDesign%2Dby%2DTrial%2Dand%2DError</link>
		<description>&lt;a href="http://news.bbc.co.uk/1/hi/sci/tech/4166076.stm"&gt;A more efficient microbe genome.&lt;/a&gt; A &lt;a href=&quot;http://www.cybertiggyr.com/gene/htdocs/shiva-0/shiva-0.html&quot;&gt;more efficient sorting algorithm&lt;/a&gt;.  A &lt;a href=&quot;http://www.visi.com/~pmk/evolved.html&quot;&gt;more efficient keyboard layout&lt;/a&gt;.  </description>
		<guid isPermaLink="false">tag:metafilter.com,2005:site.44585</guid>
		<pubDate>Fri, 26 Aug 2005 09:41:21 -0800</pubDate>
		<category>algorithms</category>
		<category>biology</category>
		<category>computers</category>
		<category>computerscience</category>
		<category>design</category>
		<category>efficiency</category>
		<category>evolution</category>
		<category>geneticalgorithms</category>
		<category>genetics</category>
		<category>genome</category>
		<category>science</category>
		<dc:creator>fatllama</dc:creator>
	</item>
      <item>
		<title>Can&apos;t Get No Satisfaction</title>
		<link>http://www.metafilter.com/31152/Cant%2DGet%2DNo%2DSatisfaction</link>
		<description>&lt;a href="http://sjcomp.virtualave.net/files/compsci9703.html"&gt;Can&apos;t Get No Satisfaction&lt;/a&gt; - This unassuming essay (it&apos;s in a state of half-decay with missing figures) is a fascinating (and accessible) overview of phase transitions in NP systems (it explains those terms).  In other words: &lt;a href=&quot;http://en.wikipedia.org/wiki/Phase_transition&quot; title=&quot;wikipedia article - pretty heavy going&quot;&gt;complex physical systems&lt;/a&gt; and &lt;a href=&quot;http://fortnow.com/lance/complog/&quot; title=&quot;a blog dedicated to complexity&quot;&gt;difficult problems in computing&lt;/a&gt; are related.  The seminal paper is &lt;a href=&quot;http://citeseer.nj.nec.com/cheeseman91where.html&quot; title=&quot;where the really hard problems are&quot;&gt;here&lt;/a&gt;, and &lt;a href=&quot;http://www.amsci.org/amsci/other/BPH.html&quot; title=&quot;mainly american scientist articles&quot;&gt;this&lt;/a&gt; is a list of other essays by the same author (links at foot of page).  </description>
		<guid isPermaLink="false">tag:metafilter.com,2004:site.31152</guid>
		<pubDate>Thu, 05 Feb 2004 08:57:20 -0800</pubDate>
		<category>brokenlink</category>
		<category>ComputationalComplexity</category>
		<category>ComputerScience</category>
		<category>essay</category>
		<category>essays</category>
		<category>mathematics</category>
		<category>science</category>
		<dc:creator>andrew cooke</dc:creator>
	</item>
      <item>
		<title>John von Neumann</title>
		<link>http://www.metafilter.com/30431/John%2Dvon%2DNeumann</link>
		<description>&lt;a href="http://www.physics.umd.edu/robot/neum/pvn05.jpg"&gt;John von Neumann, 1903-1957&lt;/a&gt; . Today may have been the 100 year anniversary of the birth of John von Neumann (some think he may have been born on December 3rd). Along with Alan Turing and others, Von Neumann is one of the contenders for the title &quot;Inventor of the modern computer.&quot; Whatever the precise date, it seems worth celebrating with some von Neumannania: 
&lt;a href=&quot;http://en.wikipedia.org/wiki/John_von_Neumann&quot;&gt;1&lt;/a&gt;, 
&lt;a href=&quot;http://www.rit.edu/~drk4633/vonNeumann/&quot;&gt;10&lt;/a&gt;, 
&lt;a href=&quot;http://ei.cs.vt.edu/~history/VonNeumann.html&quot;&gt;11&lt;/a&gt;, 
&lt;a href=&quot;http://www.zyvex.com/nanotech/vonNeumann.html&quot;&gt;100&lt;/a&gt;, 
&lt;a href=&quot;http://www.physics.umd.edu/robot/neumann.html&quot;&gt;101&lt;/a&gt;, 
&lt;a href=&quot;http://lcweb2.loc.gov/cgi-bin/query/r?faid/faid:@field(DOCID+ms996003)&quot;&gt;110&lt;/a&gt;, 
&lt;a href=&quot;http://cscs.umich.edu/~crshalizi/notebooks/von-neumann.html&quot;&gt;111&lt;/a&gt;, 
&lt;a href=&quot;http://www.salem.mass.edu/~tevans/VonNeuma.htm&quot;&gt;1000&lt;/a&gt;, 
&lt;a href=&quot;http://www.automaton.ch/ca/vonNeumann.html&quot;&gt;1001&lt;/a&gt;.  </description>
		<guid isPermaLink="false">tag:metafilter.com,2003:site.30431</guid>
		<pubDate>Sun, 28 Dec 2003 10:14:24 -0800</pubDate>
		<category>computerscience</category>
		<category>johnvonneumann</category>
		<category>mathematics</category>
		<dc:creator>carter</dc:creator>
	</item>
      <item>
		<title>How much RAM would you like with your brain, sir?</title>
		<link>http://www.metafilter.com/24246/How%2Dmuch%2DRAM%2Dwould%2Dyou%2Dlike%2Dwith%2Dyour%2Dbrain%2Dsir</link>
		<description> &lt;a href=&quot;http://www.newscientist.com/news/news.jsp?id=ns99993488&quot; _blank&gt;World&apos;s first brain prosthesis revealed.&lt;/a&gt;

Well, first hippocampus replacement at least. If this is not a dead end for science (which I doubt), I am gonna get my soul fully digitalized in 2020, then spreading it on the whole net with some new version of a code-red virus. :-)  </description>
		<guid isPermaLink="false">tag:metafilter.com,2003:site.24246</guid>
		<pubDate>Thu, 13 Mar 2003 01:05:03 -0800</pubDate>
		<category>biology</category>
		<category>brains</category>
		<category>computerchips</category>
		<category>computerscience</category>
		<category>cybernetics</category>
		<category>cyborgs</category>
		<category>prosthetics</category>
		<category>RAM</category>
		<dc:creator>zerofoks</dc:creator>
	</item>
      <item>
		<title></title>
		<link>http://www.metafilter.com/16416/</link>
		<description>&lt;a href="http://www.washingtonpost.com/wp-dyn/articles/A58274-2002Apr16.html"&gt;Shaping the Learning Curve Through a Code. &lt;/a&gt; Please do not discuss any typical computer science assignment solutions here.  You might get a Georgia Tech student an F for inadvertently learning from non-approved materials. I wonder if there are Georgia Tech admin moonlighting for the RIAA?  

 </description>
		<guid isPermaLink="false">tag:metafilter.com,2002:site.16416</guid>
		<pubDate>Tue, 16 Apr 2002 19:21:20 -0800</pubDate>
		<category>brokenlink</category>
		<category>computerscience</category>
		<category>georgiatech</category>
		<dc:creator>srboisvert</dc:creator>
	</item>
      <item>
		<title></title>
		<link>http://www.metafilter.com/9907/</link>
		<description>&lt;a href="http://www.turing.org.uk/turing/"&gt;Potential forever unfulfilled.&lt;/a&gt; Alan Turing was a great scientist and philosopher, though most famous for his work in cracking the nazi Enigma encryption used for communication by their U-boats.  Turing, one of the foremost innovators in the field of computer science at its inception, was also a homosexual.  Tried and convicted for such acts in 1952, Turing committed suicide in 1954.  A &lt;a href=&quot;http://www.btinternet.com/~glynhughes/sculpture/turing.htm&quot;&gt;bronze statue&lt;/a&gt; is now being erected in honor of Turing, even as the research he&apos;d begun in computer science is still incomplete.  </description>
		<guid isPermaLink="false">tag:metafilter.com,2001:site.9907</guid>
		<pubDate>Wed, 05 Sep 2001 14:54:27 -0800</pubDate>
		<category>alanturing</category>
		<category>computerscience</category>
		<dc:creator>moz</dc:creator>
	</item>
      <item>
		<title></title>
		<link>http://www.metafilter.com/6817/</link>
		<description>&lt;a href="http://www.newscientist.com/dailynews/news.jsp?id=ns9999595"&gt;Article on New Scientist&lt;/a&gt; about &quot;software that turns everyday language into computer code&quot;.  </description>
		<guid isPermaLink="false">tag:metafilter.com,2001:site.6817</guid>
		<pubDate>Thu, 05 Apr 2001 18:30:32 -0800</pubDate>
		<category>brokenlink</category>
		<category>code</category>
		<category>computers</category>
		<category>ComputerScience</category>
		<category>NewScientist</category>
		<category>programming</category>
		<category>software</category>
		<dc:creator>paladin</dc:creator>
	</item>
      <item>
		<title></title>
		<link>http://www.metafilter.com/821/</link>
		<description>&lt;a href="http://www.ccsf.caltech.edu/~roy/dataquan/"&gt;Apparently,&lt;/a&gt;  the digitization of all words ever spoken by human beings would take up 5,000,000,000,000,000,000 bytes. Or, 5 &lt;a href=&quot;http://www.ccsf.caltech.edu/~roy/dataquan/ety.html&quot;&gt;exa&lt;/a&gt;bytes. How long will it be before &lt;a href=&quot;http://www.go2mac.com/articles/read.cfm?id=153&quot;&gt;my laptop&lt;/a&gt; has that much space?  </description>
		<guid isPermaLink="false">tag:metafilter.com,2000:site.821</guid>
		<pubDate>Wed, 23 Feb 2000 11:16:17 -0800</pubDate>
		<category>brokenlink</category>
		<category>CalTech</category>
		<category>computerscience</category>
		<category>digitization</category>
		<category>exabytes</category>
		<category>words</category>
		<dc:creator>sandor</dc:creator>
	</item>
      <item>
		<title></title>
		<link>http://www.metafilter.com/720/</link>
		<description>&lt;a href="http://www.iwon.com/home/news/news_article/0,11746,14701|top|02-11-2000::12:48|reuters,00.html"&gt;Uncle Sam wants YOU&lt;/a&gt; to solve the internet&apos;s problems.  President Clinton announced yesterday that, due to a complete lack of knowledge about the internet, it will cost $2 billion in 2001 to develop anti-hacker secuity.  Plus they intend on subsidizing college costs for computer science majors that agree to work for the government.  Hey if he&apos;d give me just one million dollars, I&apos;d be able to pay off my school costs and hunt down hackers personally, like &lt;a href=&quot;http://www.starwars.com/characters/boba_fett/&quot;&gt;Boba Fett&lt;/a&gt;.  </description>
		<guid isPermaLink="false">tag:metafilter.com,2000:site.720</guid>
		<pubDate>Fri, 11 Feb 2000 10:05:49 -0800</pubDate>
		<category>BillClinton</category>
		<category>brokenlink</category>
		<category>Clinton</category>
		<category>college</category>
		<category>computers</category>
		<category>ComputerScience</category>
		<category>education</category>
		<category>funding</category>
		<category>hackers</category>
		<category>security</category>
		<dc:creator>Awol</dc:creator>
	</item>
      
	</channel>
</rss>


