<?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; 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>Hector Zenil's blog on foundations, metamathematics and computation</description>
	<lastBuildDate>Sun, 31 Jan 2010 04:56:27 +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>Compression-based investigation of the dynamical properties of cellular automata</title>
		<link>http://www.mathrix.org/liquid/archives/on-the-dependability-of-initial-conditions-for-cellular-automata-classification-and-my-new-paper</link>
		<comments>http://www.mathrix.org/liquid/archives/on-the-dependability-of-initial-conditions-for-cellular-automata-classification-and-my-new-paper#comments</comments>
		<pubDate>Wed, 04 Nov 2009 14:59:47 +0000</pubDate>
		<dc:creator>Hector Zenil</dc:creator>
				<category><![CDATA[Algorithmic information theory]]></category>
		<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[New Ideas]]></category>
		<category><![CDATA[AIT]]></category>
		<category><![CDATA[cellular automata classification]]></category>
		<category><![CDATA[chaos theory]]></category>
		<category><![CDATA[compression]]></category>
		<category><![CDATA[dynamical systems]]></category>
		<category><![CDATA[hypersensitivity]]></category>
		<category><![CDATA[Lyapunov exponent]]></category>
		<category><![CDATA[phase transitions]]></category>
		<category><![CDATA[Wolfram's 4 classes]]></category>

		<guid isPermaLink="false">http://www.mathrix.org/liquid/?p=305</guid>
		<description><![CDATA[A method for studying the qualitative dynamical properties of abstract computing machines based on the approximation of their program-size complexity using a general lossless compression algorithm is presented. It is shown 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 CA behavior. A Gray code-based numbering scheme for initial conditions and a compression based method to estimate a characteristic exponent to detect phase transitions and measure the resiliency or sensitivity of a system to its initial conditions is also proposed, constituting a compression-based framework for investigating the dynamical properties of cellular automata and other systems.]]></description>
		<wfw:commentRss>http://www.mathrix.org/liquid/archives/on-the-dependability-of-initial-conditions-for-cellular-automata-classification-and-my-new-paper/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[Darwin]]></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>
		<item>
		<title>Leibniz medallion comes to life after 300 years in celebration of Greg Chaitin&#8217;s career</title>
		<link>http://www.mathrix.org/liquid/archives/the-history-of-the-chaitin-leibniz-medallion</link>
		<comments>http://www.mathrix.org/liquid/archives/the-history-of-the-chaitin-leibniz-medallion#comments</comments>
		<pubDate>Sat, 03 Nov 2007 04:01:44 +0000</pubDate>
		<dc:creator>Hector Zenil</dc:creator>
				<category><![CDATA[Algorithmic information theory]]></category>
		<category><![CDATA[General]]></category>
		<category><![CDATA[AIT]]></category>
		<category><![CDATA[Chaitin's Omega]]></category>
		<category><![CDATA[Gottfried Leibniz]]></category>
		<category><![CDATA[Gregory Chaitin]]></category>
		<category><![CDATA[Kurt Godel]]></category>
		<category><![CDATA[Stephen Wolfram]]></category>

		<guid isPermaLink="false">http://www.mathrix.org/liquid/?p=160</guid>
		<description><![CDATA[To celebrate Gregory Chaitin&#8217;s 60th birthday Stephen Wolfram decided to design a medal for him.
In the mid 1960s, while still a teenager, Chaitin created algorithmic information theory (AIT), which combines, among other elements, Shannon&#8217;s information theory and Turing&#8217;s theory of computability. In the three decades since, he has been the principal architect of AIT. Among [...]]]></description>
		<wfw:commentRss>http://www.mathrix.org/liquid/archives/the-history-of-the-chaitin-leibniz-medallion/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>On the Kolmogorov-Chaitin complexity for short sequences</title>
		<link>http://www.mathrix.org/liquid/archives/on-the-kolmogorov-chaitin-complexity-for-short-sequences</link>
		<comments>http://www.mathrix.org/liquid/archives/on-the-kolmogorov-chaitin-complexity-for-short-sequences#comments</comments>
		<pubDate>Wed, 31 Oct 2007 00:44:44 +0000</pubDate>
		<dc:creator>Hector Zenil</dc:creator>
				<category><![CDATA[Algorithmic information theory]]></category>
		<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Foundations of Computation]]></category>
		<category><![CDATA[New Ideas]]></category>
		<category><![CDATA[algorithmic complexity]]></category>
		<category><![CDATA[Cristian Calude]]></category>
		<category><![CDATA[Jean-Paul Delahaye]]></category>
		<category><![CDATA[John Casti]]></category>
		<category><![CDATA[Paul Davies]]></category>
		<category><![CDATA[randomness]]></category>
		<category><![CDATA[Stephen Wolfram]]></category>

		<guid isPermaLink="false">http://www.mathrix.org/liquid/?p=157</guid>
		<description><![CDATA[My paper On the Kolmogorov-Chaitin complexity for short sequences, coauthored with my PhD thesis advisor Jean-Paul Delahaye has been published as a book chapter in:RANDOMNESS AND COMPLEXITY, FROM LEIBNIZ TO CHAITIN, edited by Cristian S. Calude (University of Auckland, New Zealand) and published by World Scientific.
An extended draft version of this paper can be found [...]]]></description>
		<wfw:commentRss>http://www.mathrix.org/liquid/archives/on-the-kolmogorov-chaitin-complexity-for-short-sequences/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
