<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	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/"
		>
<channel>
	<title>Comments on: The Mystery of the Simplest Universal Cellular Automaton</title>
	<atom:link href="http://theunitedpersons.org/blog/simplest-universal-cellular-automaton/feed" rel="self" type="application/rss+xml" />
	<link>http://theunitedpersons.org/blog/simplest-universal-cellular-automaton</link>
	<description>helping you to save the world... &#38; some of your tax money;)</description>
	<lastBuildDate>Sat, 21 Jan 2012 14:57:33 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: mazsa</title>
		<link>http://theunitedpersons.org/blog/simplest-universal-cellular-automaton/comment-page-1#comment-473</link>
		<dc:creator>mazsa</dc:creator>
		<pubDate>Tue, 27 Apr 2010 22:16:40 +0000</pubDate>
		<guid isPermaLink="false">http://theunitedpersons.org/?p=1088#comment-473</guid>
		<description>Cf. &quot;[...] even one-dimensional cellular automata can be universal. Wolfram (2002, pp. 644-656) gave an example of a 19-color universal one-dimensional next-nearest neighbor cellular automaton in which a block of 20 cells is used to represent each single cell in the cellular automaton being emulated. The examples above show the first few steps of the 19-color universal automaton emulating rule 90 and rule 30, respectively (Wolfram 2002, pp. 646-647).&quot; http://mathworld.wolfram.com/UniversalCellularAutomaton.html and http://www.wolframscience.com/nksonline/page-645</description>
		<content:encoded><![CDATA[<p>Cf. &#8220;[...] even one-dimensional cellular automata can be universal. Wolfram (2002, pp. 644-656) gave an example of a 19-color universal one-dimensional next-nearest neighbor cellular automaton in which a block of 20 cells is used to represent each single cell in the cellular automaton being emulated. The examples above show the first few steps of the 19-color universal automaton emulating rule 90 and rule 30, respectively (Wolfram 2002, pp. 646-647).&#8221; <a href="http://mathworld.wolfram.com/UniversalCellularAutomaton.html" rel="nofollow">http://mathworld.wolfram.com/UniversalCellularAutomaton.html</a> and <a href="http://www.wolframscience.com/nksonline/page-645" rel="nofollow">http://www.wolframscience.com/nksonline/page-645</a></p>
]]></content:encoded>
	</item>
</channel>
</rss>

