<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Anima Ex Machina &#124; Hector Zenil's blog &#187; Complexity</title>
	<atom:link href="http://www.mathrix.org/liquid/category/complexity-theory/feed" rel="self" type="application/rss+xml" />
	<link>http://www.mathrix.org/liquid</link>
	<description>Hector Zenil's blog on foundations, metamathematics and computation</description>
	<lastBuildDate>Mon, 21 Jun 2010 16:35:20 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Classifying objects by complexity</title>
		<link>http://www.mathrix.org/liquid/archives/classifying-objects-by-physical-complexity-via-their-images</link>
		<comments>http://www.mathrix.org/liquid/archives/classifying-objects-by-physical-complexity-via-their-images#comments</comments>
		<pubDate>Wed, 02 Jun 2010 01:35:21 +0000</pubDate>
		<dc:creator>Hector Zenil</dc:creator>
				<category><![CDATA[Algorithmic information theory]]></category>
		<category><![CDATA[Complexity]]></category>
		<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[New Ideas]]></category>
		<category><![CDATA[algorithmic information theory]]></category>
		<category><![CDATA[Bennett's logical depth]]></category>
		<category><![CDATA[complexity]]></category>

		<guid isPermaLink="false">http://www.mathrix.org/liquid/?p=430</guid>
		<description><![CDATA[We present a method for estimating the complexity of an image based on the concept of Bennett's logical depth. We use this measure to classify images by their information content. The method provides a means for evaluating and classifying objects by way of their visual representations.]]></description>
		<wfw:commentRss>http://www.mathrix.org/liquid/archives/classifying-objects-by-physical-complexity-via-their-images/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Stephen Hawking: A brief examination of the recent warning over alien civilizations</title>
		<link>http://www.mathrix.org/liquid/archives/stephen-hawking-a-brief-in-depth-examination-of-the-warning-over-alien-civilizations</link>
		<comments>http://www.mathrix.org/liquid/archives/stephen-hawking-a-brief-in-depth-examination-of-the-warning-over-alien-civilizations#comments</comments>
		<pubDate>Tue, 04 May 2010 10:30:01 +0000</pubDate>
		<dc:creator>Hector Zenil</dc:creator>
				<category><![CDATA[Complexity]]></category>
		<category><![CDATA[Foundations of Biology]]></category>
		<category><![CDATA[General]]></category>
		<category><![CDATA[New Ideas]]></category>
		<category><![CDATA[Recreation]]></category>
		<category><![CDATA[alien civilization]]></category>
		<category><![CDATA[intelligent life]]></category>
		<category><![CDATA[Principle of Computational Equivalence]]></category>
		<category><![CDATA[stephen hawking]]></category>

		<guid isPermaLink="false">http://www.mathrix.org/liquid/archives/stephen-hawking-a-brief-in-depth-examination-of-the-warning-over-alien-civilizations</guid>
		<description><![CDATA[Stephen Hawking asserts that while aliens almost certainly exist, humans should avoid making contact. 
The original story published by BBC News can be found here.

He claims: &#8220;We only have to look at ourselves to see how intelligent life might develop into something we wouldn&#8217;t want to meet.&#8221; 
Stephen Hawking recent assertion looks like an interesting [...]]]></description>
		<wfw:commentRss>http://www.mathrix.org/liquid/archives/stephen-hawking-a-brief-in-depth-examination-of-the-warning-over-alien-civilizations/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>On the Algorithmic Nature of the World</title>
		<link>http://www.mathrix.org/liquid/archives/algorithmic-nature-all-out-of-randomness</link>
		<comments>http://www.mathrix.org/liquid/archives/algorithmic-nature-all-out-of-randomness#comments</comments>
		<pubDate>Wed, 21 Apr 2010 22:10:15 +0000</pubDate>
		<dc:creator>Hector Zenil</dc:creator>
				<category><![CDATA[Algorithmic information theory]]></category>
		<category><![CDATA[Complexity]]></category>
		<category><![CDATA[New Ideas]]></category>

		<guid isPermaLink="false">http://www.mathrix.org/liquid/?p=358</guid>
		<description><![CDATA[In a new paper I&#8217;ve coauthored with Jean-Paul Delahaye, we propose a test based on the theory of algorithmic complexity and an experimental evaluation of Levin&#8217;s universal distribution to identify evidence in support of or in contravention of the claim that the world is algorithmic in nature. 
To this end we have undertaken a statistical [...]]]></description>
		<wfw:commentRss>http://www.mathrix.org/liquid/archives/algorithmic-nature-all-out-of-randomness/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Evaluating the complexity of a living organism by its algorithmic complexity</title>
		<link>http://www.mathrix.org/liquid/archives/living-organism-algorithmic-complexity-logical-depth-genetic-toolkit</link>
		<comments>http://www.mathrix.org/liquid/archives/living-organism-algorithmic-complexity-logical-depth-genetic-toolkit#comments</comments>
		<pubDate>Sat, 26 Sep 2009 21:51:36 +0000</pubDate>
		<dc:creator>Hector Zenil</dc:creator>
				<category><![CDATA[Algorithmic information theory]]></category>
		<category><![CDATA[Complexity]]></category>
		<category><![CDATA[Foundations of Biology]]></category>
		<category><![CDATA[General]]></category>
		<category><![CDATA[New Ideas]]></category>
		<category><![CDATA[AIT]]></category>
		<category><![CDATA[algorithmic nature]]></category>
		<category><![CDATA[biology]]></category>
		<category><![CDATA[Darwin]]></category>
		<category><![CDATA[evolution]]></category>
		<category><![CDATA[life]]></category>

		<guid isPermaLink="false">http://www.mathrix.org/liquid/?p=236</guid>
		<description><![CDATA[One of the greatest scientific achievements of the last century was the understanding of life in terms of information. We know today that the information for synthesizing the molecules that allow organisms to survive and replicate is encoded in the DNA. In the cell, DNA is copied to messenger RNA, and triplet codons in the [...]]]></description>
		<wfw:commentRss>http://www.mathrix.org/liquid/archives/living-organism-algorithmic-complexity-logical-depth-genetic-toolkit/feed</wfw:commentRss>
		<slash:comments>6</slash:comments>
		</item>
		<item>
		<title>The Shortest Universal Turing Machine Implementation Contest</title>
		<link>http://www.mathrix.org/liquid/archives/the-shortest-universal-turing-machine-implementation-contest</link>
		<comments>http://www.mathrix.org/liquid/archives/the-shortest-universal-turing-machine-implementation-contest#comments</comments>
		<pubDate>Mon, 22 Dec 2008 23:52:23 +0000</pubDate>
		<dc:creator>Hector Zenil</dc:creator>
				<category><![CDATA[Algorithmic information theory]]></category>
		<category><![CDATA[Complexity]]></category>
		<category><![CDATA[Computability, Universality and Unsolvability]]></category>
		<category><![CDATA[Foundations of Computation]]></category>
		<category><![CDATA[New Ideas]]></category>
		<category><![CDATA[Recreation]]></category>
		<category><![CDATA[Add new tag]]></category>
		<category><![CDATA[Turing machine]]></category>

		<guid isPermaLink="false">http://www.mathrix.org/liquid/?p=211</guid>
		<description><![CDATA[========================================
The Shortest Universal Turing Machine Implementation Contest
                          ANNOUNCEMENT
                          23 Dec &#8211; 2008
  http://www.mathrix.org/experimentalAIT/TuringMachine.html
========================================
Contest Overview
============
In the spirit of the busy beaver competition though related to program-size complexity, we are pleased to announce the &#8220;Shortest Universal [...]]]></description>
		<wfw:commentRss>http://www.mathrix.org/liquid/archives/the-shortest-universal-turing-machine-implementation-contest/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
