<?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 &#187; Algorithmic information theory</title>
	<atom:link href="http://www.mathrix.org/liquid/category/algorithmic-complexity-and-randomness/feed" rel="self" type="application/rss+xml" />
	<link>http://www.mathrix.org/liquid</link>
	<description>The blog of Hector Zenil</description>
	<lastBuildDate>Sat, 28 Jan 2012 14:42:37 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
		<item>
		<title>An alternative method (to compression) for approximating the algorithmic complexity of strings</title>
		<link>http://www.mathrix.org/liquid/archives/shortstringscomplexity</link>
		<comments>http://www.mathrix.org/liquid/archives/shortstringscomplexity#comments</comments>
		<pubDate>Wed, 20 Jul 2011 20:49:53 +0000</pubDate>
		<dc:creator>Hector Zenil</dc:creator>
				<category><![CDATA[Algorithmic information theory]]></category>
		<category><![CDATA[Foundations of Computation]]></category>
		<category><![CDATA[New Ideas]]></category>

		<guid isPermaLink="false">http://www.mathrix.org/liquid/?p=786</guid>
		<description><![CDATA[The method introduced in my doctoral dissertation was featured in the French version of Scientific American Pour La Science in its July 2011 issue No. 405 under the title Le défi des faibles complexités. Jean-Paul Delahaye points out that: Comme les très petites durées ou longueurs, les faibles complexités sont délicates à évaluer. Paradoxalement, les [...]]]></description>
		<wfw:commentRss>http://www.mathrix.org/liquid/archives/shortstringscomplexity/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>&#8220;The World is Either Algorithmic or Mostly Random&#8221; awarded a 3rd Place Prize in this year&#8217;s FQXi contest</title>
		<link>http://www.mathrix.org/liquid/archives/fqxi</link>
		<comments>http://www.mathrix.org/liquid/archives/fqxi#comments</comments>
		<pubDate>Fri, 10 Jun 2011 14:33:00 +0000</pubDate>
		<dc:creator>Hector Zenil</dc:creator>
				<category><![CDATA[Algorithmic information theory]]></category>
		<category><![CDATA[Complexity]]></category>
		<category><![CDATA[Foundations of Computation]]></category>
		<category><![CDATA[Foundations of Physics]]></category>
		<category><![CDATA[General]]></category>
		<category><![CDATA[New Ideas]]></category>

		<guid isPermaLink="false">http://www.mathrix.org/liquid/?p=753</guid>
		<description><![CDATA[Based on the combined ratings of the contest community and the panel of expert reviewers appointed by the FXQi, which included the members of the institute, I was awarded a 3rd Place Prize for my work The World is Either Algorithmic or Mostly Random in this year’s FQXi contest on the topic Is Reality Digital [...]]]></description>
		<wfw:commentRss>http://www.mathrix.org/liquid/archives/fqxi/feed</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Compression-based Investigation of Cellular Automata, A Phase Transition Coefficient and a Conjecture Related to Universal Computation</title>
		<link>http://www.mathrix.org/liquid/archives/compression-based-investigation-of-the-dynamical-properties-of-cellular-automata-phase-transition-classification-and-a-universality-conjecture</link>
		<comments>http://www.mathrix.org/liquid/archives/compression-based-investigation-of-the-dynamical-properties-of-cellular-automata-phase-transition-classification-and-a-universality-conjecture#comments</comments>
		<pubDate>Sun, 22 Aug 2010 02:18:32 +0000</pubDate>
		<dc:creator>Hector Zenil</dc:creator>
				<category><![CDATA[Algorithmic information theory]]></category>
		<category><![CDATA[Computability, Universality and Unsolvability]]></category>
		<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Foundations of Computation]]></category>
		<category><![CDATA[New Ideas]]></category>

		<guid isPermaLink="false">http://www.mathrix.org/liquid/?p=448</guid>
		<description><![CDATA[In a recent paper, forthcoming in the Journal of Complex Systems, vol. 19, I present a method for studying the qualitative behavior of cellular automata and other abstract computing machines based on the approximation of their program-size complexity using a general lossless compression algorithm. I show that the compression-based approach classifies cellular automata (CA) into clusters according to their heuristic behavior, with these clusters showing a correspondence with Wolfram's main classes of systemic behavior. I also present a Gray code-based numbering scheme for initial conditions optimal for this kind of investigations, and a compression based method for estimating a characteristic exponent in the form of a phase transition coefficient measuring the resiliency or sensitivity of a system to its initial conditions. I also conjecture that universal systems have large transition coefficients.]]></description>
		<wfw:commentRss>http://www.mathrix.org/liquid/archives/compression-based-investigation-of-the-dynamical-properties-of-cellular-automata-phase-transition-classification-and-a-universality-conjecture/feed</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<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>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>
	</channel>
</rss>

