<?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/"
	xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd"
	xmlns:media="http://search.yahoo.com/mrss/"
>

<channel>
	<title>The Math Factor Podcast &#187; logic</title>
	<atom:link href="http://mathfactor.uark.edu/category/the-mathfactor-podcast/logic/feed/" rel="self" type="application/rss+xml" />
	<link>http://mathfactor.uark.edu</link>
	<description>The Math Factor Podcast Site</description>
	<lastBuildDate>Sun, 22 Nov 2009 07:52:25 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.5</generator>
	<language></language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<!-- podcast_generator="podPress/8.8" -->
		<copyright>&#xA9; </copyright>
		<managingEditor>strauss@uark.edu ()</managingEditor>
		<webMaster>strauss@uark.edu()</webMaster>
		<category></category>
		<itunes:keywords></itunes:keywords>
		<itunes:subtitle></itunes:subtitle>
		<itunes:summary>The Math Factor Podcast Site</itunes:summary>
		<itunes:author></itunes:author>
		<itunes:category text="Society &amp; Culture"/>
		<itunes:owner>
			<itunes:name></itunes:name>
			<itunes:email>strauss@uark.edu</itunes:email>
		</itunes:owner>
		<itunes:block>No</itunes:block>
		<itunes:explicit>no</itunes:explicit>
		<itunes:image href="http://mathfactor.uark.edu/mathfactor/podcastImage.jpg" />
		<image>
			<url></url>
			<title>The Math Factor Podcast</title>
			<link>http://mathfactor.uark.edu</link>
			<width>144</width>
			<height>144</height>
		</image>
		<item>
		<title>GC. Another Buncha Prisoners</title>
		<link>http://mathfactor.uark.edu/2009/07/gc-another-buncha-prisoners/</link>
		<comments>http://mathfactor.uark.edu/2009/07/gc-another-buncha-prisoners/#comments</comments>
		<pubDate>Tue, 28 Jul 2009 15:43:38 +0000</pubDate>
		<dc:creator>strauss</dc:creator>
				<category><![CDATA[The Mathcast]]></category>
		<category><![CDATA[Yoak]]></category>
		<category><![CDATA[answers]]></category>
		<category><![CDATA[guests]]></category>
		<category><![CDATA[logic]]></category>
		<category><![CDATA[math puzzles]]></category>
		<category><![CDATA[numbers]]></category>

		<guid isPermaLink="false">http://mathfactor.uark.edu/?p=746</guid>
		<description><![CDATA[Man, what is it with puzzlers and prisoners? Jeff Yoak lines &#8216;em up and the stakes are high in this week&#8217;s puzzle.&#160;
Also, we are now twittering at MathFactor; each of the authors has an account of his own; mine is CGoodmanStrauss. You can tag solutions and comments with #mathfactor. See you there!
]]></description>
			<content:encoded><![CDATA[<p>Man, what is it with puzzlers and prisoners? Jeff Yoak lines &#8216;em up and the stakes are high in this week&#8217;s puzzle.&nbsp;</p>
<p>Also, we are now twittering at MathFactor; each of the authors has an account of his own; mine is CGoodmanStrauss. You can tag solutions and comments with #mathfactor. See you there!</p>
]]></content:encoded>
			<wfw:commentRss>http://mathfactor.uark.edu/2009/07/gc-another-buncha-prisoners/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
			<enclosure url="http://mathfactor.uark.edu/podpress_trac/feed/746/0/158%20Another%20Buncha%20Prisoners%20_Math_Factor_2009_07_28.mp3" length="8333795" type="audio/mpeg"/>
<itunes:duration>00:01:01</itunes:duration>
		<itunes:subtitle>Man, what is it with puzzlers and prisoners? Jeff Yoak lines 'em up and the stakes are high in this week's puzzle.#160;

Also, we are now ...</itunes:subtitle>
		<itunes:summary>Man, what is it with puzzlers and prisoners? Jeff Yoak lines 'em up and the stakes are high in this week's puzzle.#160;

Also, we are now twittering at MathFactor; each of the authors has an account of his own; mine is CGoodmanStrauss. You can tag solutions and comments with #mathfactor. See you there!</itunes:summary>
		<itunes:keywords>The,Mathcast,,Yoak,,answers,,guests,,logic,,math,puzzles,,numbers</itunes:keywords>
		<itunes:author>strauss@uark.edu</itunes:author>
		<itunes:explicit>no</itunes:explicit>
		<itunes:block>No</itunes:block>
	</item>
		<item>
		<title>GB. Hat Strategy</title>
		<link>http://mathfactor.uark.edu/2009/07/gb-hat-strategy/</link>
		<comments>http://mathfactor.uark.edu/2009/07/gb-hat-strategy/#comments</comments>
		<pubDate>Tue, 28 Jul 2009 15:40:12 +0000</pubDate>
		<dc:creator>strauss</dc:creator>
				<category><![CDATA[The Mathcast]]></category>
		<category><![CDATA[Yoak]]></category>
		<category><![CDATA[answers]]></category>
		<category><![CDATA[guests]]></category>
		<category><![CDATA[logic]]></category>
		<category><![CDATA[math puzzles]]></category>
		<category><![CDATA[numbers]]></category>

		<guid isPermaLink="false">http://mathfactor.uark.edu/?p=744</guid>
		<description><![CDATA[How can three people, each required to guess the color of hat on their head, strategize and maximize the chances they&#8217;ll all be right?
]]></description>
			<content:encoded><![CDATA[<p>How can three people, each required to guess the color of hat on their head, strategize and maximize the chances they&#8217;ll all be right?</p>
]]></content:encoded>
			<wfw:commentRss>http://mathfactor.uark.edu/2009/07/gb-hat-strategy/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
			<enclosure url="http://mathfactor.uark.edu/podpress_trac/feed/744/0/157%20Hat%20Strategy%20_Math_Factor_2009_07_20.mp3" length="3381371" type="audio/mpeg"/>
<itunes:duration>00:01:01</itunes:duration>
		<itunes:subtitle>How can three people, each required to guess the color of hat on their head, strategize and maximize the chances they'll all be right? </itunes:subtitle>
		<itunes:summary>How can three people, each required to guess the color of hat on their head, strategize and maximize the chances they'll all be right?</itunes:summary>
		<itunes:keywords>The,Mathcast,,Yoak,,answers,,guests,,logic,,math,puzzles,,numbers</itunes:keywords>
		<itunes:author>strauss@uark.edu</itunes:author>
		<itunes:explicit>no</itunes:explicit>
		<itunes:block>No</itunes:block>
	</item>
		<item>
		<title>ET. Your Holiday Shopping Guide</title>
		<link>http://mathfactor.uark.edu/2008/12/et-your-holiday-shopping-guide/</link>
		<comments>http://mathfactor.uark.edu/2008/12/et-your-holiday-shopping-guide/#comments</comments>
		<pubDate>Mon, 01 Dec 2008 23:16:28 +0000</pubDate>
		<dc:creator>strauss</dc:creator>
				<category><![CDATA[Favorites]]></category>
		<category><![CDATA[The Mathcast]]></category>
		<category><![CDATA[logic]]></category>
		<category><![CDATA[math puzzles]]></category>
		<category><![CDATA[toys and math products]]></category>
		<category><![CDATA[Binary Arts]]></category>
		<category><![CDATA[Bodycombe]]></category>
		<category><![CDATA[Martin Gardner]]></category>
		<category><![CDATA[Moscovitch]]></category>
		<category><![CDATA[Nikoli]]></category>
		<category><![CDATA[Puzzellations]]></category>
		<category><![CDATA[toys]]></category>
		<category><![CDATA[Zome]]></category>

		<guid isPermaLink="false">http://mathfactor.uark.edu/?p=280</guid>
		<description><![CDATA[Our favorite new and not-so-new products of 2008!

Check out these great gifts!

Zome is an incredibly powerful construction system!
the great puzzles of Puzzellation (available at Barnes and Nobles)
The terrific puzzle computer game DROD
The Magic Mirror Image Coloring Book
 The Riddles of the Sphinx by David J Bodycombe, an amazing compendium of puzzles, of hundreds of kinds, [...]]]></description>
			<content:encoded><![CDATA[<p>Our favorite new and not-so-new products of 2008!</p>
<p></p>
<p>Check out these great gifts!</p>
<ul>
<li><a href="http://www.zometool.com/">Zome</a> is an incredibly powerful construction system!</li>
<li>the great puzzles of <a href="http://mathartfun.com/shopsite_sc/store/html/index.html">Puzzellation</a> (available at <a href="http://gifts.barnesandnoble.com/search/results.asp?WRD=puzzellations&#038;TYP=T">Barnes and Nobles</a>)</li>
<li>The terrific puzzle computer game <a href="http://forum.caravelgames.com/viewsitepage.php?id=90294">DROD</a></li>
<li><a href="http://store.doverpublications.com/0486468194.html">The Magic Mirror Image Coloring Book</a></li>
<li> <a href="http://us.penguingroup.com/nf/Book/BookDisplay/0,,9780143112754,00.html?The_Riddles_of_the_Sphinx_David_J._Bodycombe">The Riddles of the Sphinx</a> by David J Bodycombe, an amazing compendium of puzzles, of hundreds of kinds, at all levels of difficulty, with historical essays to boot!</li>
<li>Which leads us to <a href="http://www.nikoli.com/">Nikoli</a>, the great Japanese puzzle co! (<a href="http://en.wikipedia.org/wiki/List_of_Nikoli_puzzle_types">Rules can be found here</a>)</li>
<li><a href="http://www.amazon.com/Princeton-Companion-Mathematics-Timothy-Gowers/dp/0691118809/ref=sr_1_1?ie=UTF8&#038;s=books&#038;qid=1228172703&#038;sr=1-1">The Princeton Companion to Mathematics</a> is a landmark classic. A must-have for every serious student, researcher or amateur.</li>
<li><a href="http://www.amazon.com/How-Round-Your-Circle-Engineering/dp/069113118X/ref=sr_1_1?ie=UTF8&#038;s=books&#038;qid=1228172772&#038;sr=1-1">How Round is Your Circle</a> just one of the many fantastic titles out on Princeton University Press</li>
<li><a href="http://akpeters.com/">AK Peters</a> is another fantastic press, with a wide range of interesting math and CS titles, including, ahem, <a href="http://akpeters.com/product.asp?ProdCode=2205">the Symmetries of Things</a>.</li>
<li><a href="http://www.thinkfun.com/">Binary Arts/ThinkFun</a> is another source of great puzzles!</li>
<li>And the authors <a href="http://www.amazon.com/s/ref=nb_ss_gw_0_11?url=search-alias%3Daps&#038;field-keywords=martin+gardner&#038;sprefix=martin+gard">Martin Gardner</a> and <a href="http://www.amazon.com/s/ref=nb_ss_gw_1_7?url=search-alias%3Daps&#038;field-keywords=ivan+moscovich&#038;sprefix=ivan+mo">Ivan Moscovitch</a> are always fantastic!</li>
</ul>
<p>Hope this helps and have fun!! Let us know how it works out! </p>
<p>Happy Holidays from the Math Factor!</p>
]]></content:encoded>
			<wfw:commentRss>http://mathfactor.uark.edu/2008/12/et-your-holiday-shopping-guide/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
			<enclosure url="http://mathfactor.uark.edu/podpress_trac/feed/280/0/124%20Your%20Holiday%20Gift%20Guide_Math_Factor_2008_12_01.mp3" length="16593097" type="audio/mpeg"/>
<itunes:duration>17:14</itunes:duration>
		<itunes:subtitle>Our favorite new and not-so-new products of 2008!



Check out these great gifts!

	Zome is an incredibly powerful construction system!
	the great puzzles of Puzzellation (available at Barnes ...</itunes:subtitle>
		<itunes:summary>Our favorite new and not-so-new products of 2008!



Check out these great gifts!

	Zome is an incredibly powerful construction system!
	the great puzzles of Puzzellation (available at Barnes and Nobles)
	The terrific puzzle computer game DROD
	The Magic Mirror Image Coloring Book	
 The Riddles of the Sphinx by David J Bodycombe, an amazing compendium of puzzles, of hundreds of kinds, at all levels of difficulty, with historical essays to boot!
	Which leads us to Nikoli, the great Japanese puzzle co! (Rules can be found here)
	The Princeton Companion to Mathematics is a landmark classic. A must-have for every serious student, researcher or amateur.
	How Round is Your Circle just one of the many fantastic titles out on Princeton University Press
	AK Peters is another fantastic press, with a wide range of interesting math and CS titles, including, ahem, the Symmetries of Things.
	Binary Arts/ThinkFun is another source of great puzzles!
	And the authors Martin Gardner and Ivan Moscovitch are always fantastic!


Hope this helps and have fun!! Let us know how it works out! 

Happy Holidays from the Math Factor!</itunes:summary>
		<itunes:keywords>Favorites,,The,Mathcast,,logic,,math,puzzles,,toys,and,math,products</itunes:keywords>
		<itunes:author>strauss@uark.edu</itunes:author>
		<itunes:explicit>no</itunes:explicit>
		<itunes:block>No</itunes:block>
	</item>
		<item>
		<title>Follow Up: The Harmonic Series</title>
		<link>http://mathfactor.uark.edu/2008/08/follow-up-the-harmonic-series/</link>
		<comments>http://mathfactor.uark.edu/2008/08/follow-up-the-harmonic-series/#comments</comments>
		<pubDate>Sat, 16 Aug 2008 19:18:18 +0000</pubDate>
		<dc:creator>strauss</dc:creator>
				<category><![CDATA[Follow Up]]></category>
		<category><![CDATA[answers]]></category>
		<category><![CDATA[infinity]]></category>
		<category><![CDATA[logic]]></category>
		<category><![CDATA[paradoxes]]></category>

		<guid isPermaLink="false">http://mathfactor.uark.edu/?p=245</guid>
		<description><![CDATA[That the worm falls off the end of the rope depends on the fact that the incredible
 harmonic series 
1 + 1/2 + 1/3 + 1/4 + . . . 
diverges to infinity, growing as large as you please!

 If you try adding terms up on a calculator, this scarcely seems possible! By the time [...]]]></description>
			<content:encoded><![CDATA[<p>That the worm falls off the end of the rope depends on the fact that the incredible<br />
 harmonic series </p>
<p>1 + 1/2 + 1/3 + 1/4 + . . . <br />
diverges to infinity, growing as large as you please!</p>
<p><span id="more-245"></span></p>
<p> If you try adding terms up on a calculator, this scarcely seems possible! By the time you have added the hundredth term, you will have a reached only a whopping 5.187&#8230; (and each new term will be less than .01).</p>
<p>After adding up a <i> million</i> terms, you will have made it only to about 14.39272672&#8230; &#8212; and each new term will be less than .000001. Does the series <i> really </i> diverge?</p>
<p>The eighteenth century mathematician <a href="http://en.wikipedia.org/wiki/Jacob_Bernoulli">Jacob Bernoulli</a> gave a very elegant proof that it does:</p>
<p>1/2 is at least 1/2</p>
<p>1/3 + 1/4 is at least 1/4 + 1/4 = 1/2</p>
<p>1/5 + 1/6 + 1/7 + 1/8 is at least 1/8 + 1/8 + 1/8 + 1/8 = 1/2</p>
<p>1/9 + . . . + 1/16 is at least 8 x 1/16 = 1/2</p>
<p>etc. So the result of adding up the first 2<sup>n</sup> terms 1/2 + 1/3 + . . . + 1/2<sup>n</sup> is at least n/2, and in particular, can be as large as we please.</p>
<p>But this <i> does </i> take a long time to get anywhere. To add up to, say, 100, Bernoulli&#8217;s proof shows us that  2<sup>198</sup> (about 4&#215;10<sup>59</sup>) terms will suffice. But maybe this is more than we actually need.</p>
<hr />
<p>A basic fact from calculus is that the area under the curve y = 1/x, from x = 1 to x = N is exactly ln N.</p>
<p align = "center"><img src="http://mathfactor.uark.edu/images/harmonic1.jpg"/></p>
<p>Now the area of a box 1 unit wide and 1/n units tall is 1/n, and boxes of width 1 and heights 1, 1/2, 1/3, . . . altogether have area 1 + 1/2 + 1/3 . . .</p>
<p> Here we see that these boxes can be arranged to show that </p>
<p>1 + 1/2 + 1/3 + 1/4 + 1/5 + 1/6 + 1/7 > ln 8</p>
<p align = "center"><img src="http://mathfactor.uark.edu/images/harmonicA.jpg"/>
</p>
<p>Shifting the boxes over, we see that</p>
<p>1/2 + 1/3 + 1/4 + 1/5 + 1/6 + 1/7 + 1/8 < ln 8</p>
</p>
<p align = "center"><img src="http://mathfactor.uark.edu/images/harmonic2.jpg"/></p>
<p>This gives us a much better bound on the harmonic series. Generally,  we have that </p>
<p>1 + 1/2 + . . . + 1/n is between ln (n+1) and (ln n) + 1. </p>
<p>So to be sure that the series sums to at least 100, we can be sure that e<sup>100-1</sup> (about 2.7&#215;10<sup>43</sup>) terms will suffice!</p>
<hr /> The great <a href = "http://en.wikipedia.org/wiki/Euler">Leonhard Euler</a> proved that in fact, in the long run, 1 + . . . + 1/n tends to be exactly ln n plus a constant; Euler&#8217;s constant, usually denoted by &gamma; (gamma), is about .577215664901&#8230;</p>
<p>So the sum of the first million terms is about (ln 1,000,000) + &gamma;,  and if we want to sum to 100, we need to have n such that ln n + &gamma; is greater than 100; in other words, e<sup> (100 &#8211; &gamma;)</sup> (about 1.5&#215;10<sup>43</sup>) terms will do.</p>
<hr />
<p><small> The series &Sigma; 1/(n ln n) diverges even more slowly still, taking about e^e^n terms to sum to n (!!) The series &Sigma; 1/(n (ln n) (ln ln n)) takes e^e^e^n terms to sum to n. Etc!!</small></p>
]]></content:encoded>
			<wfw:commentRss>http://mathfactor.uark.edu/2008/08/follow-up-the-harmonic-series/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>EG. The Colossal Book of Short Puzzles and Problems</title>
		<link>http://mathfactor.uark.edu/2008/08/eg-the-colossal-book-of-short-puzzles-and-problems/</link>
		<comments>http://mathfactor.uark.edu/2008/08/eg-the-colossal-book-of-short-puzzles-and-problems/#comments</comments>
		<pubDate>Tue, 12 Aug 2008 17:47:00 +0000</pubDate>
		<dc:creator>strauss</dc:creator>
				<category><![CDATA[Favorites]]></category>
		<category><![CDATA[The Mathcast]]></category>
		<category><![CDATA[Topology and geometry]]></category>
		<category><![CDATA[guests]]></category>
		<category><![CDATA[infinity]]></category>
		<category><![CDATA[logic]]></category>
		<category><![CDATA[math puzzles]]></category>
		<category><![CDATA[numbers]]></category>
		<category><![CDATA[paradoxes]]></category>
		<category><![CDATA[cube]]></category>
		<category><![CDATA[Dana Richards]]></category>
		<category><![CDATA[Gardner]]></category>
		<category><![CDATA[geometry]]></category>
		<category><![CDATA[puzzle]]></category>
		<category><![CDATA[worm]]></category>

		<guid isPermaLink="false">http://mathfactor.uark.edu/?p=244</guid>
		<description><![CDATA[
 
Dana Richards, editor of The Colossal Book of Short Puzzles and Problems discusses the amazing Martin Gardner and his legacy!
]]></description>
			<content:encoded><![CDATA[<p></p>
<p align = "center"><a href = "http://www.amazon.com/Colossal-Book-Short-Puzzles-Problems/dp/0393061140/ref=sr_1_1?ie=UTF8&#038;s=books&#038;qid=1218562498&#038;sr=8-1"> <img src = "http://mathfactor.uark.edu/images/mg.jpg"/></a></p>
<p>Dana Richards, editor of <a href = "http://www.amazon.com/Colossal-Book-Short-Puzzles-Problems/dp/0393061140/ref=sr_1_1?ie=UTF8&#038;s=books&#038;qid=1218562498&#038;sr=8-1">The Colossal Book of Short Puzzles and Problems</a> discusses the amazing Martin Gardner and his legacy!</p>
]]></content:encoded>
			<wfw:commentRss>http://mathfactor.uark.edu/2008/08/eg-the-colossal-book-of-short-puzzles-and-problems/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
			<enclosure url="http://mathfactor.uark.edu/podpress_trac/feed/244/0/111%20The%20Colossal%20Book%20of%20Short%20Puzzles%20and%20Problems%20_Math_Factor_2008_08_12.mp3" length="10416289" type="audio/mpeg"/>
<itunes:duration>6:10</itunes:duration>
		<itunes:subtitle>Dana Richards, editor of The Colossal Book of Short Puzzles and Problems discusses the amazing Martin Gardner and his legacy!
 </itunes:subtitle>
		<itunes:summary>Dana Richards, editor of The Colossal Book of Short Puzzles and Problems discusses the amazing Martin Gardner and his legacy!
</itunes:summary>
		<itunes:keywords>Favorites,,The,Mathcast,,Topology,and,geometry,,guests,,infinity,,logic,,math,puzzles,,numbers,,paradoxes</itunes:keywords>
		<itunes:author>strauss@uark.edu</itunes:author>
		<itunes:explicit>no</itunes:explicit>
		<itunes:block>No</itunes:block>
	</item>
		<item>
		<title>EC. Skyrocketing Functions!</title>
		<link>http://mathfactor.uark.edu/2008/07/ec-skyrocketing-functions/</link>
		<comments>http://mathfactor.uark.edu/2008/07/ec-skyrocketing-functions/#comments</comments>
		<pubDate>Tue, 01 Jul 2008 21:59:17 +0000</pubDate>
		<dc:creator>strauss</dc:creator>
				<category><![CDATA[The Mathcast]]></category>
		<category><![CDATA[logic]]></category>
		<category><![CDATA[numbers]]></category>
		<category><![CDATA[paradoxes]]></category>

		<guid isPermaLink="false">http://mathfactor.uark.edu/2008/07/01/ec-skyrocketing-functions/</guid>
		<description><![CDATA[
Faster than an exponential! More powerful than double factorials!! The Busy Beaver Function tops anything that could ever be computed&#8211; and we mean  ever 
]]></description>
			<content:encoded><![CDATA[<p></p>
<p>Faster than an exponential! More powerful than double factorials!! The Busy Beaver Function tops anything that could ever be computed&#8211; and we mean <i> ever </i></p>
]]></content:encoded>
			<wfw:commentRss>http://mathfactor.uark.edu/2008/07/ec-skyrocketing-functions/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
			<enclosure url="http://mathfactor.uark.edu/podpress_trac/feed/238/0/107%20Skyrocketing%20functions%20_Math_Factor_2008_06_29.mp3" length="10393676" type="audio/mpeg"/>
<itunes:duration>8:37</itunes:duration>
		<itunes:subtitle>Faster than an exponential! More powerful than double factorials!! The Busy Beaver Function tops anything that could ever be computed-- and we mean  ever ...</itunes:subtitle>
		<itunes:summary>Faster than an exponential! More powerful than double factorials!! The Busy Beaver Function tops anything that could ever be computed-- and we mean  ever 
</itunes:summary>
		<itunes:keywords>The,Mathcast,,logic,,numbers,,paradoxes</itunes:keywords>
		<itunes:author>strauss@uark.edu</itunes:author>
		<itunes:explicit>no</itunes:explicit>
		<itunes:block>No</itunes:block>
	</item>
		<item>
		<title>EB. Busy Beavers and Dumb Robots</title>
		<link>http://mathfactor.uark.edu/2008/06/eb-busy-beavers-and-dumb-robots/</link>
		<comments>http://mathfactor.uark.edu/2008/06/eb-busy-beavers-and-dumb-robots/#comments</comments>
		<pubDate>Sun, 22 Jun 2008 22:04:59 +0000</pubDate>
		<dc:creator>strauss</dc:creator>
				<category><![CDATA[The Mathcast]]></category>
		<category><![CDATA[logic]]></category>
		<category><![CDATA[numbers]]></category>

		<guid isPermaLink="false">http://mathfactor.uark.edu/2008/06/22/eb-busy-beavers-and-dumb-robots/</guid>
		<description><![CDATA[
Those dumb robots can do anything! Anything at all, that any computer can do.
]]></description>
			<content:encoded><![CDATA[<p></p>
<p>Those dumb robots can do anything! Anything at all, that any computer can do.</p>
]]></content:encoded>
			<wfw:commentRss>http://mathfactor.uark.edu/2008/06/eb-busy-beavers-and-dumb-robots/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
			<enclosure url="http://mathfactor.uark.edu/podpress_trac/feed/239/0/106%20Busy%20Beavers%20and%20Dumb%20Robots%20_Math_Factor_2008_06_19.mp3" length="1" type="audio/mpeg"/>
<itunes:duration>16:25</itunes:duration>
		<itunes:subtitle>Those dumb robots can do anything! Anything at all, that any computer can do.
 </itunes:subtitle>
		<itunes:summary>Those dumb robots can do anything! Anything at all, that any computer can do.
</itunes:summary>
		<itunes:keywords>The,Mathcast,,logic,,numbers</itunes:keywords>
		<itunes:author>strauss@uark.edu</itunes:author>
		<itunes:explicit>no</itunes:explicit>
		<itunes:block>No</itunes:block>
	</item>
		<item>
		<title>EA. The Limits of Computation</title>
		<link>http://mathfactor.uark.edu/2008/06/ea-the-limits-of-computation/</link>
		<comments>http://mathfactor.uark.edu/2008/06/ea-the-limits-of-computation/#comments</comments>
		<pubDate>Thu, 12 Jun 2008 19:14:15 +0000</pubDate>
		<dc:creator>strauss</dc:creator>
				<category><![CDATA[The Mathcast]]></category>
		<category><![CDATA[logic]]></category>
		<category><![CDATA[paradoxes]]></category>

		<guid isPermaLink="false">http://mathfactor.uark.edu/?p=236</guid>
		<description><![CDATA[One of the great discoveries of the twentieth century is that mathematics can describe the limits of mathematical thought! We&#8217;ll discuss some of these ideas from time to time in coming weeks. In this segment, we consider Alan Turing&#8217;s insightful question:
Can the answer to any mathematical question be computed?

We&#8217;ve also prepared a  more comprehensive, [...]]]></description>
			<content:encoded><![CDATA[<p>One of the great discoveries of the twentieth century is that mathematics can describe the limits of mathematical thought! We&#8217;ll discuss some of these ideas from time to time in coming weeks. In this segment, we consider Alan Turing&#8217;s insightful question:</p>
<p><i>Can the answer to any mathematical question be computed?</i></p>
<p><span id="more-236"></span></p>
<p>We&#8217;ve also prepared a <a href="http://mathfactor.uark.edu/downloads/computation_draft.pdf"> more comprehensive, much more subtle discussion</a> here. </p>
<p><small><i> Of course we misspoke in the podcast when we said that Goldbach conjectured that </i> every<i> even number is the sum of two primes &emdash; 2 itself is not!</i><br />
</small></p>
]]></content:encoded>
			<wfw:commentRss>http://mathfactor.uark.edu/2008/06/ea-the-limits-of-computation/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
			<enclosure url="http://mathfactor.uark.edu/podpress_trac/feed/236/0/105%20The%20Limits%20of%20Computation%20_Math_Factor_2008_06_12.mp3" length="1" type="audio/mpeg"/>
<itunes:duration>00:01:01</itunes:duration>
		<itunes:subtitle>One of the great discoveries of the twentieth century is that mathematics can describe the limits of mathematical thought! We'll discuss some of these ideas ...</itunes:subtitle>
		<itunes:summary>One of the great discoveries of the twentieth century is that mathematics can describe the limits of mathematical thought! We'll discuss some of these ideas from time to time in coming weeks. In this segment, we consider Alan Turing's insightful question:
Can the answer to any mathematical question be computed?

We've also prepared a  more comprehensive, much more subtle discussion here. 
 Of course we misspoke in the podcast when we said that Goldbach conjectured that  every even number is the sum of two primes emdash; 2 itself is not!

</itunes:summary>
		<itunes:keywords>The,Mathcast,,logic,,paradoxes</itunes:keywords>
		<itunes:author>strauss@uark.edu</itunes:author>
		<itunes:explicit>no</itunes:explicit>
		<itunes:block>No</itunes:block>
	</item>
		<item>
		<title>DV. Dealing with Chaos</title>
		<link>http://mathfactor.uark.edu/2008/05/dw-dealing-with-chaos/</link>
		<comments>http://mathfactor.uark.edu/2008/05/dw-dealing-with-chaos/#comments</comments>
		<pubDate>Mon, 05 May 2008 14:13:56 +0000</pubDate>
		<dc:creator>strauss</dc:creator>
				<category><![CDATA[The Mathcast]]></category>
		<category><![CDATA[answers]]></category>
		<category><![CDATA[logic]]></category>

		<guid isPermaLink="false">http://mathfactor.uark.edu/2008/05/05/dw-dealing-with-chaos/</guid>
		<description><![CDATA[We explore Barry Cipra&#8217;s Tag Deal a bit more&#8230;
]]></description>
			<content:encoded><![CDATA[<p>We explore Barry Cipra&#8217;s Tag Deal a bit more&#8230;</p>
]]></content:encoded>
			<wfw:commentRss>http://mathfactor.uark.edu/2008/05/dw-dealing-with-chaos/feed/</wfw:commentRss>
		<slash:comments>10</slash:comments>
			<enclosure url="http://mathfactor.uark.edu/podpress_trac/feed/230/0/100%20Dealing%20with%20Chaos%20_Math_Factor_2008_05_01.mp3" length="10206109" type="audio/mpeg"/>
<itunes:duration>00:01:01</itunes:duration>
		<itunes:subtitle>We explore Barry Cipra's Tag Deal a bit more...
 </itunes:subtitle>
		<itunes:summary>We explore Barry Cipra's Tag Deal a bit more...
</itunes:summary>
		<itunes:keywords>The,Mathcast,,answers,,logic</itunes:keywords>
		<itunes:author>strauss@uark.edu</itunes:author>
		<itunes:explicit>no</itunes:explicit>
		<itunes:block>No</itunes:block>
	</item>
		<item>
		<title>DT. Speaking of Self-reference</title>
		<link>http://mathfactor.uark.edu/2008/04/dt-speaking-of-self-reference/</link>
		<comments>http://mathfactor.uark.edu/2008/04/dt-speaking-of-self-reference/#comments</comments>
		<pubDate>Mon, 14 Apr 2008 12:12:09 +0000</pubDate>
		<dc:creator>strauss</dc:creator>
				<category><![CDATA[The Mathcast]]></category>
		<category><![CDATA[guests]]></category>
		<category><![CDATA[logic]]></category>
		<category><![CDATA[math puzzles]]></category>
		<category><![CDATA[paradoxes]]></category>

		<guid isPermaLink="false">http://mathfactor.uark.edu/2008/04/14/dt-speaking-of-self-reference/</guid>
		<description><![CDATA[We catch up with Raymond Smullyan, author of  many fantastic books on logic, puzzles and paradoxes at this year&#8217;s Gathering for Gardner!
]]></description>
			<content:encoded><![CDATA[<p>We catch up with <a href='http://en.wikipedia.org/wiki/Raymond_Smullyan'>Raymond Smullyan</a>, author of <a href='http://www.amazon.com/s/ref=nb_ss_gw/102-2878998-0969722?url=search-alias%3Dstripbooks&#038;field-keywords=smullyan&#038;x=0&#038;y=0'> many fantastic books on logic, puzzles and paradoxes</a> at this year&#8217;s Gathering for Gardner!</p>
]]></content:encoded>
			<wfw:commentRss>http://mathfactor.uark.edu/2008/04/dt-speaking-of-self-reference/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
			<enclosure url="http://mathfactor.uark.edu/podpress_trac/feed/227/0/98%20Speaking%20of%20Self%20Reference%20_Math_Factor_2008_04_12.mp3" length="6010180" type="audio/mpeg"/>
<itunes:duration>6:12</itunes:duration>
		<itunes:subtitle>We catch up with Raymond Smullyan, author of  many fantastic books on logic, puzzles and paradoxes at this year's Gathering for Gardner! </itunes:subtitle>
		<itunes:summary>We catch up with Raymond Smullyan, author of  many fantastic books on logic, puzzles and paradoxes at this year's Gathering for Gardner!</itunes:summary>
		<itunes:keywords>The,Mathcast,,guests,,logic,,math,puzzles,,paradoxes</itunes:keywords>
		<itunes:author>strauss@uark.edu</itunes:author>
		<itunes:explicit>no</itunes:explicit>
		<itunes:block>No</itunes:block>
	</item>
	</channel>
</rss>
