<?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; Foundations of Computation</title>
	<atom:link href="http://www.mathrix.org/liquid/category/foundations-of-computing/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>Comments on Turing&#8217;s very first Universal machine approaching Turing&#8217;s 100th. birthday anniversary</title>
		<link>http://www.mathrix.org/liquid/archives/turings-very-first-universal-machine</link>
		<comments>http://www.mathrix.org/liquid/archives/turings-very-first-universal-machine#comments</comments>
		<pubDate>Tue, 18 May 2010 00:56:45 +0000</pubDate>
		<dc:creator>Hector Zenil</dc:creator>
				<category><![CDATA[Computability, Universality and Unsolvability]]></category>
		<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Foundations of Computation]]></category>
		<category><![CDATA[Minds and Machines]]></category>

		<guid isPermaLink="false">http://www.mathrix.org/liquid/?p=421</guid>
		<description><![CDATA[The idea that a machine could perform the tasks of any other machine is the description of a Universal (Turing) machine. Its invention is considered by many to have been  one of the major landmarks giving rise to the field of computer science. &#8216;Universal&#8217; means that one can &#8216;program&#8217; a general-purpose machine to perform [...]]]></description>
		<wfw:commentRss>http://www.mathrix.org/liquid/archives/turings-very-first-universal-machine/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Physics-like computation, Wolfram&#8217;s PCE and Church&#8217;s thesis</title>
		<link>http://www.mathrix.org/liquid/archives/physics-like-computation-wolframs-principle-of-computational-and-churchs-thesis</link>
		<comments>http://www.mathrix.org/liquid/archives/physics-like-computation-wolframs-principle-of-computational-and-churchs-thesis#comments</comments>
		<pubDate>Wed, 07 Jan 2009 20:32:31 +0000</pubDate>
		<dc:creator>Hector Zenil</dc:creator>
				<category><![CDATA[Computability, Universality and Unsolvability]]></category>
		<category><![CDATA[Foundations of Computation]]></category>
		<category><![CDATA[General]]></category>
		<category><![CDATA[physics of computation]]></category>
		<category><![CDATA[Principle of Computational Equivalence]]></category>

		<guid isPermaLink="false">http://www.mathrix.org/liquid/?p=174</guid>
		<description><![CDATA[
The lack of correspondence between the abstract and the physical world seems sometimes to suggest that there are profound incompatibilities between what can be thought and what actually happens in the real world. One can ask, for example, how often one faces undecidable problems. However, the question of undecidability has been considered to be better [...]]]></description>
		<wfw:commentRss>http://www.mathrix.org/liquid/archives/physics-like-computation-wolframs-principle-of-computational-and-churchs-thesis/feed</wfw:commentRss>
		<slash:comments>0</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>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>
		<item>
		<title>On the simplest and smallest universal Turing machine</title>
		<link>http://www.mathrix.org/liquid/archives/the-simplest-and-smallest-universal-turing-machine-was-found</link>
		<comments>http://www.mathrix.org/liquid/archives/the-simplest-and-smallest-universal-turing-machine-was-found#comments</comments>
		<pubDate>Tue, 30 Oct 2007 03:03:27 +0000</pubDate>
		<dc:creator>Hector Zenil</dc:creator>
				<category><![CDATA[Complexity]]></category>
		<category><![CDATA[Computability, Universality and Unsolvability]]></category>
		<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[Foundations of Computation]]></category>
		<category><![CDATA[General]]></category>
		<category><![CDATA[computational complexity]]></category>
		<category><![CDATA[NKS]]></category>
		<category><![CDATA[Principle of Computational Equivalence]]></category>
		<category><![CDATA[Turing machine]]></category>
		<category><![CDATA[universality]]></category>

		<guid isPermaLink="false">http://www.mathrix.org/liquid/?p=155</guid>
		<description><![CDATA[Why research on the universality of the Wolfram 2,3 Turing machine (http://www.wolframscience.com/prizes/tm23/) and the small universal Turing machine  is relevant for modern computer science:
* New techniques for proving universality are being developed (Alex Smith&#8217;s novel approach for unbounded computations from arbitrary lengths and non-periodic initial configurations).
* Completely new universal systems have been discovered (cyclic tag- [...]]]></description>
		<wfw:commentRss>http://www.mathrix.org/liquid/archives/the-simplest-and-smallest-universal-turing-machine-was-found/feed</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
	</channel>
</rss>
