<?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>Decoded Science &#187; Mike DeHaan</title>
	<atom:link href="http://www.decodedscience.com/author/mike-dehaan/feed" rel="self" type="application/rss+xml" />
	<link>http://www.decodedscience.com</link>
	<description>Science news, information and theories for the interested observer</description>
	<lastBuildDate>Thu, 17 May 2012 08:16:33 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
<xhtml:meta xmlns:xhtml="http://www.w3.org/1999/xhtml" name="robots" content="noindex" />
		<item>
		<title>Algorithm to Solve Arranged Marriages via the Hall Theorem</title>
		<link>http://www.decodedscience.com/arranged-marriage-problem-hall-theorem/12970</link>
		<comments>http://www.decodedscience.com/arranged-marriage-problem-hall-theorem/12970#comments</comments>
		<pubDate>Tue, 08 May 2012 17:27:10 +0000</pubDate>
		<dc:creator>Mike DeHaan</dc:creator>
				<category><![CDATA[Math Theory]]></category>
		<category><![CDATA[arranged marriage by computer]]></category>
		<category><![CDATA[hall theorem]]></category>
		<category><![CDATA[marriage theory]]></category>
		<category><![CDATA[math]]></category>
		<category><![CDATA[Mathematical Induction]]></category>
		<category><![CDATA[mathematics]]></category>

		<guid isPermaLink="false">http://www.decodedscience.com/?p=12970</guid>
		<description><![CDATA[According to Hall's Marriage Theorem, a computer algorithm can correctly assign brides to grooms for optimum happiness. Dating services use computer programs to match prospective mates, but group matching by list is pure math theory. ]]></description>
		<wfw:commentRss>http://www.decodedscience.com/arranged-marriage-problem-hall-theorem/12970/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Is it Possible for Turing Machines to Solve the Halting Problem?</title>
		<link>http://www.decodedscience.com/turing-machines-and-the-halting-problem/12672</link>
		<comments>http://www.decodedscience.com/turing-machines-and-the-halting-problem/12672#comments</comments>
		<pubDate>Mon, 23 Apr 2012 16:47:52 +0000</pubDate>
		<dc:creator>Mike DeHaan</dc:creator>
				<category><![CDATA[Math Theory]]></category>
		<category><![CDATA[halting problem]]></category>
		<category><![CDATA[math]]></category>
		<category><![CDATA[mathematics]]></category>
		<category><![CDATA[theory of computing]]></category>
		<category><![CDATA[turing machine]]></category>
		<category><![CDATA[universal turing machine]]></category>

		<guid isPermaLink="false">http://www.decodedscience.com/?p=12672</guid>
		<description><![CDATA[Alan Turing (1912-1954) "invented" his Turing Machine to represent the process of making mathematical inferences. The penultimate goal was to determine whether the "Halting Problem" could be solved. So, what's the "Halting Problem?]]></description>
		<wfw:commentRss>http://www.decodedscience.com/turing-machines-and-the-halting-problem/12672/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>The Universal Turing Machine is a Turing Machine Emulator</title>
		<link>http://www.decodedscience.com/what-is-universal-turing-machine/12081</link>
		<comments>http://www.decodedscience.com/what-is-universal-turing-machine/12081#comments</comments>
		<pubDate>Thu, 29 Mar 2012 21:21:33 +0000</pubDate>
		<dc:creator>Mike DeHaan</dc:creator>
				<category><![CDATA[Computing]]></category>
		<category><![CDATA[tms]]></category>
		<category><![CDATA[turing machines]]></category>
		<category><![CDATA[universal turing machine]]></category>
		<category><![CDATA[utms]]></category>

		<guid isPermaLink="false">http://www.decodedscience.com/?p=12081</guid>
		<description><![CDATA[Can one Turing machine emulate another? Are Turing machines guaranteed to finish a task? As Tolkien said about the advice that elves provide, the answer is &#8220;both yes and no.&#8221; Essentially, the Universal Turing machine represents the ability for a &#8220;computer&#8221; to manipulate a program just as it deals with data. Review of a Standard Turing Machine A standard Turing machine, or &#8216;TM&#8217;, is able to solve a great variety of problems in mathematics, pattern recognition, and pattern creation, although it is only a theoretical construct rather than a physical computer. The Turing machine&#8217;s program consists of a set of states. Such a program can process any number of different patterns on its input tape, with the option to accept or reject the input or to update cells on the tape. Variations on Turing machines include having more than one tape and a read/write head for each tape. This may make it easier to describe a program, but does not add any greater &#8220;power&#8221; to the class of problems it can solve. One tape can always be segregated by special symbols, and any length of symbol can be shifted onto blank areas of the tape. Using multiple tapes allows the [...]]]></description>
		<wfw:commentRss>http://www.decodedscience.com/what-is-universal-turing-machine/12081/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>The ACM Awards the 2011 Turing Prize for Computing to Judea Pearl</title>
		<link>http://www.decodedscience.com/the-acm-awards-the-2011-turing-prize-for-computing-to-judea-pearl/11782</link>
		<comments>http://www.decodedscience.com/the-acm-awards-the-2011-turing-prize-for-computing-to-judea-pearl/11782#comments</comments>
		<pubDate>Tue, 20 Mar 2012 14:27:41 +0000</pubDate>
		<dc:creator>Mike DeHaan</dc:creator>
				<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[Headlines]]></category>
		<category><![CDATA[acm]]></category>
		<category><![CDATA[am turing award]]></category>
		<category><![CDATA[artificial intelligence]]></category>
		<category><![CDATA[math]]></category>
		<category><![CDATA[mathematics]]></category>
		<category><![CDATA[turing award]]></category>

		<guid isPermaLink="false">http://www.decodedscience.com/?p=11782</guid>
		<description><![CDATA[The ACM Turing Award winner for 2011 is Judea Pearl. This computing award has been presented annually since 1966, with multiple recipients in some years. This year&#8217;s winner has advanced artificial intelligence by improving the way in which AI programs acquire additional information, among other things. The first winner of the Turing award, Alan Jay Perlis, was well-known for his advances in the area of programming languages. Judea Pearl won the Turing Award for 2011 in Artificial Intelligence The most recent ACM Turing Award winner, announced in March 2012, is Judea Pearl. He has &#8220;transformed artificial intelligence (AI)&#8230;for the processing of information under uncertainty.&#8221; Pearl was born in Tel Aviv. He earned his bachelor&#8217;s degree in Israel, his Master&#8217;s at Rutgers and his PhD from the Brooklyn Polytechnic Institute. He devotes considerable time to the Daniel Pearl Foundation, which promotes cross-cultural understanding in memory of Judea&#8217;s son Daniel. One early approach to artificial intelligence created AI systems by asking experts to write rules; the AI then required precise information about a specific situation in order to apply and follow those rules. Pearl recognized that experts must also deal with uncertainty. He implemented the mathematics of probability theory as algorithms, or [...]]]></description>
		<wfw:commentRss>http://www.decodedscience.com/the-acm-awards-the-2011-turing-prize-for-computing-to-judea-pearl/11782/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>The Special Case of Non-Deterministic Turing Machines</title>
		<link>http://www.decodedscience.com/the-special-case-of-non-deterministic-turing-machines/11082</link>
		<comments>http://www.decodedscience.com/the-special-case-of-non-deterministic-turing-machines/11082#comments</comments>
		<pubDate>Tue, 28 Feb 2012 17:00:39 +0000</pubDate>
		<dc:creator>Mike DeHaan</dc:creator>
				<category><![CDATA[Math Theory]]></category>
		<category><![CDATA[math]]></category>
		<category><![CDATA[mathematics]]></category>
		<category><![CDATA[parallel computation]]></category>
		<category><![CDATA[quantum computer]]></category>
		<category><![CDATA[quantum computing]]></category>
		<category><![CDATA[turing machine]]></category>

		<guid isPermaLink="false">http://www.decodedscience.com/?p=11082</guid>
		<description><![CDATA[Alan Turing (1912-1954) &#8220;invented&#8221; the Turing machine (TM) as a powerful theoretical model for mathematicians exploring rules-based mathematics. The  Non-deterministic Turing machine, or NTM, extends the basic concept by permitting multiple instructions for one state-input combination. The Deterministic Turing Machine A Turing machine has a finite number of states, symbols and instructions. A pattern of symbols are presented on an infinitely long &#8220;tape&#8221;. The TM reads or rewrites one symbol in one cell of the tape, then moves right or left by one cell. A TM is programmed with instructions. A deterministic Turing machine is limited to one instruction for each state to deal with each symbol, plus optional states to &#8220;halt and accept&#8221; or &#8220;halt and reject&#8221; the tape&#8217;s initial pattern. A TM either halts or continues processing without halting. What is a Non-Deterministic Turing Machine? A non-deterministic Turing machine allows multiple instructions for any one state as it reads any one input symbol. Mathematically, the mapping from the state plus symbol is a relation, rather than a function. Conceptually, a non-deterministic TM runs many isolated computations in parallel. Another useful concept is a decision tree structure. A node with branches is created each time an NTM begins a parallel computation. Each &#8220;leaf&#8221; of [...]]]></description>
		<wfw:commentRss>http://www.decodedscience.com/the-special-case-of-non-deterministic-turing-machines/11082/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

