<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.2.2" -->
<rss version="2.0" 
	xmlns:content="http://purl.org/rss/1.0/modules/content/">
<channel>
	<title>Comments on: Math: the book</title>
	<link>http://scottaaronson.com/blog/?p=384</link>
	<description>The Blog of Scott Aaronson</description>
	<pubDate>Fri, 10 Sep 2010 04:14:14 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.2.2</generator>

	<item>
		<title>By: Egipt</title>
		<link>http://scottaaronson.com/blog/?p=384#comment-32578</link>
		<author>Egipt</author>
		<pubDate>Sun, 08 Mar 2009 21:29:37 +0000</pubDate>
		<guid>http://scottaaronson.com/blog/?p=384#comment-32578</guid>
		<description>Ian Durham, thats right. Very good book. Contains more than 1000 original technical illustrations, a multitude of reproductions from mathematical classics and other relevant works, and a generous sprinkling of humorous asides, ranging from limericks and tall stories to cartoons and decorative drawings.</description>
		<content:encoded><![CDATA[<p>Ian Durham, thats right. Very good book. Contains more than 1000 original technical illustrations, a multitude of reproductions from mathematical classics and other relevant works, and a generous sprinkling of humorous asides, ranging from limericks and tall stories to cartoons and decorative drawings.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Martin M. Musatov</title>
		<link>http://scottaaronson.com/blog/?p=384#comment-32219</link>
		<author>Martin M. Musatov</author>
		<pubDate>Tue, 03 Mar 2009 04:17:50 +0000</pubDate>
		<guid>http://scottaaronson.com/blog/?p=384#comment-32219</guid>
		<description>Doron Zeilberger's 45th Opinion
Apr 1, 2002 ... Every mathematician is trying to solve at least one of the seven notorious ... since we mathematicians and theoretical computer scientists care very little ... than a mundane `rigorous mathematical proof' of PNP would have been. ... hence it is safe for Mr. and Mrs. Clay to offer big prizes!, ...
www.math.rutgers.edu/~zeilberg/Opinion45.html - 6k - Cached - Similar pages - 

Somebody has to speak for those not able to...</description>
		<content:encoded><![CDATA[<p>Doron Zeilberger&#8217;s 45th Opinion<br />
Apr 1, 2002 &#8230; Every mathematician is trying to solve at least one of the seven notorious &#8230; since we mathematicians and theoretical computer scientists care very little &#8230; than a mundane `rigorous mathematical proof&#8217; of PNP would have been. &#8230; hence it is safe for Mr. and Mrs. Clay to offer big prizes!, &#8230;<br />
<a href="http://www.math.rutgers.edu/~zeilberg/Opinion45.html" rel="nofollow">www.math.rutgers.edu/~zeilberg/Opinion45.html</a> - 6k - Cached - Similar pages - </p>
<p>Somebody has to speak for those not able to&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Greg Kuperberg</title>
		<link>http://scottaaronson.com/blog/?p=384#comment-31960</link>
		<author>Greg Kuperberg</author>
		<pubDate>Thu, 19 Feb 2009 17:53:27 +0000</pubDate>
		<guid>http://scottaaronson.com/blog/?p=384#comment-31960</guid>
		<description>Well yes, Greg E (except for the E I feel as if I'm debating with myself), my emendation of Davies was secretly meant to be untenable and backhanded.

But then, a few of Freeman Dyson's errors are also irreparable.  Part of my real point is that sometimes we are a little too generous with mathematicians and scientists who win big awards.</description>
		<content:encoded><![CDATA[<p>Well yes, Greg E (except for the E I feel as if I&#8217;m debating with myself), my emendation of Davies was secretly meant to be untenable and backhanded.</p>
<p>But then, a few of Freeman Dyson&#8217;s errors are also irreparable.  Part of my real point is that sometimes we are a little too generous with mathematicians and scientists who win big awards.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Greg Egan</title>
		<link>http://scottaaronson.com/blog/?p=384#comment-31955</link>
		<author>Greg Egan</author>
		<pubDate>Thu, 19 Feb 2009 10:01:44 +0000</pubDate>
		<guid>http://scottaaronson.com/blog/?p=384#comment-31955</guid>
		<description>Greg K, the problem is not so much that Davies says something analogous to claiming that my iMac has "32 bits of RAM", which could be brushed off as a typo in need of exponentiation, but that he then goes on to infer all kinds of sweeping consequences about the nature of the laws of physics that don't actually follow at all from the "generous" (i.e. correct) interpretation of his original assertion.</description>
		<content:encoded><![CDATA[<p>Greg K, the problem is not so much that Davies says something analogous to claiming that my iMac has &#8220;32 bits of RAM&#8221;, which could be brushed off as a typo in need of exponentiation, but that he then goes on to infer all kinds of sweeping consequences about the nature of the laws of physics that don&#8217;t actually follow at all from the &#8220;generous&#8221; (i.e. correct) interpretation of his original assertion.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Greg Kuperberg</title>
		<link>http://scottaaronson.com/blog/?p=384#comment-31951</link>
		<author>Greg Kuperberg</author>
		<pubDate>Thu, 19 Feb 2009 07:06:11 +0000</pubDate>
		<guid>http://scottaaronson.com/blog/?p=384#comment-31951</guid>
		<description>&lt;i&gt;Paul is just completely, totally, flat-out wrong about the holographic bound imposing an upper limit of 400 qubits.&lt;/i&gt;

But let's be generous with him just as we would be with a Nobel Laureate such as Freeman Dyson who sometimes says wrong things.  The holographic bound does say that there is an upper limit of 400 qubits needed to &lt;b&gt;address&lt;/b&gt; any qubit in the universe.  A computer in the observable universe will never need more than a 400-bit address bus.</description>
		<content:encoded><![CDATA[<p><i>Paul is just completely, totally, flat-out wrong about the holographic bound imposing an upper limit of 400 qubits.</i></p>
<p>But let&#8217;s be generous with him just as we would be with a Nobel Laureate such as Freeman Dyson who sometimes says wrong things.  The holographic bound does say that there is an upper limit of 400 qubits needed to <b>address</b> any qubit in the universe.  A computer in the observable universe will never need more than a 400-bit address bus.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Raoul Ohio</title>
		<link>http://scottaaronson.com/blog/?p=384#comment-31947</link>
		<author>Raoul Ohio</author>
		<pubDate>Thu, 19 Feb 2009 04:32:05 +0000</pubDate>
		<guid>http://scottaaronson.com/blog/?p=384#comment-31947</guid>
		<description>Job,

I love Wikipedia, and also math and physics books. They play a different role. In most of Physics and CS, you can work some problems, see how it goes, and move on to other aspects of the subject. In math (and complexity theory) a major role is played by delineating exactly what is proven. Thus some fraction of the books must start with the axioms and inch their way forward. Usually these don't make light reading.

Classic examples in math are an analysis book by Landau (same guy who introduced/popularized the O and o symbols?) starting with some axioms (ZF set theory? I forgot) and proving and numbering each theorem through advanced calculus and into real analysis. Along the way, the first place the axiom of choice is truly needed is noted (existence of a non lebesgue measurable set?) I believe Titchmarsh followed up by carrying the numbering on through all the theorems of classical complex analysis (possibly in http://www.amazon.com/Theory-Functions-Edward-C-Titchmarsh/dp/0198533497, still in print).

I doubt if many are interested in reading these treatments, but it is nice knowing they are there in case you need them. Contrast this with Wikipedia: usually (for tech stuff) pretty good, often interesting, but you are never quite sure that it is right. Also, it might change in the next couple minutes, usually for the better. There is also the problem of topics that nuts and quacks take an interest in.</description>
		<content:encoded><![CDATA[<p>Job,</p>
<p>I love Wikipedia, and also math and physics books. They play a different role. In most of Physics and CS, you can work some problems, see how it goes, and move on to other aspects of the subject. In math (and complexity theory) a major role is played by delineating exactly what is proven. Thus some fraction of the books must start with the axioms and inch their way forward. Usually these don&#8217;t make light reading.</p>
<p>Classic examples in math are an analysis book by Landau (same guy who introduced/popularized the O and o symbols?) starting with some axioms (ZF set theory? I forgot) and proving and numbering each theorem through advanced calculus and into real analysis. Along the way, the first place the axiom of choice is truly needed is noted (existence of a non lebesgue measurable set?) I believe Titchmarsh followed up by carrying the numbering on through all the theorems of classical complex analysis (possibly in <a href="http://www.amazon.com/Theory-Functions-Edward-C-Titchmarsh/dp/0198533497," rel="nofollow">http://www.amazon.com/Theory-Functions-Edward-C-Titchmarsh/dp/0198533497,</a> still in print).</p>
<p>I doubt if many are interested in reading these treatments, but it is nice knowing they are there in case you need them. Contrast this with Wikipedia: usually (for tech stuff) pretty good, often interesting, but you are never quite sure that it is right. Also, it might change in the next couple minutes, usually for the better. There is also the problem of topics that nuts and quacks take an interest in.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Peter Norvig</title>
		<link>http://scottaaronson.com/blog/?p=384#comment-31777</link>
		<author>Peter Norvig</author>
		<pubDate>Fri, 13 Feb 2009 01:08:55 +0000</pubDate>
		<guid>http://scottaaronson.com/blog/?p=384#comment-31777</guid>
		<description>I ordered my copy after seeing your piece.  It arrived yesterday, and when I opened to a random page, I saw "NP Completeness (definition of)." I thought that was appropriate to this blog.</description>
		<content:encoded><![CDATA[<p>I ordered my copy after seeing your piece.  It arrived yesterday, and when I opened to a random page, I saw &#8220;NP Completeness (definition of).&#8221; I thought that was appropriate to this blog.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: asdf</title>
		<link>http://scottaaronson.com/blog/?p=384#comment-31703</link>
		<author>asdf</author>
		<pubDate>Tue, 10 Feb 2009 08:28:23 +0000</pubDate>
		<guid>http://scottaaronson.com/blog/?p=384#comment-31703</guid>
		<description>Scott, thanks.   I looked further at Paul Davies' paper and although I still don't understand it much, I can see that the 400 qubit number is somewhat pulled out of nowhere.</description>
		<content:encoded><![CDATA[<p>Scott, thanks.   I looked further at Paul Davies&#8217; paper and although I still don&#8217;t understand it much, I can see that the 400 qubit number is somewhat pulled out of nowhere.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John Sidles</title>
		<link>http://scottaaronson.com/blog/?p=384#comment-31650</link>
		<author>John Sidles</author>
		<pubDate>Sun, 08 Feb 2009 12:09:39 +0000</pubDate>
		<guid>http://scottaaronson.com/blog/?p=384#comment-31650</guid>
		<description>Mathematical books that are clear, comprehensive, and inspiring to students obviously are &lt;i&gt;good&lt;/i&gt;.  However---by Bohr's Opposites Principle---it follows that mathematical books that are dismally opaque, grossly incomplete, and hugely intimidating to students, are good too.

&lt;i&gt;"Yeah,"&lt;/i&gt; you're thinking &lt;i&gt;"but what are some examples?  Aside from pretty much everything by Grothendieck, I mean."&lt;/i&gt;

Well, the Clay Mathematical institute has two &lt;a href="http://www.claymath.org/publications/proceedings.php" rel="nofollow"&gt;on-line proceedings&lt;/a&gt; &lt;i&gt;Strings and Geometry&lt;/i&gt;, and &lt;i&gt;Mirror Symmetry&lt;/i&gt; that (IMHO) are pretty good examples.

In aggregate, these two proceedings are 1,324 pages of cutting-edge mathematical excellence, in which dozens of mathematicians do their very best to explain to students (and to each other) what's going on.

Do they succeed?  Well ... as the &lt;i&gt;Mirror Symmetry&lt;/i&gt; introduction candidly describes it:&lt;blockquote&gt;We are at a delicate point in the history of the interaction of [math and physics]: while both fields desperately need each other, the relationship seems at times to be a dysfunctional codependence rather than a happy marriage!&lt;/blockquote&gt;Why would a practical engineer be looking at these two proceedings?  Well, we take a practical interest in the intersection of information theory and geometric quantum mechanics---that intersection being a working definition of the core mathematics of quantum simulation science.  

So I was keyword-searching for informatic-type concepts like "decoherence, entanglement, simulation, tensor networks, Choi, Kraus, Stinespring".

Zero, zip, nada.   Which is (from one point of view) very &lt;i&gt;good&lt;/i&gt; news for students ... because it means that fundamental mathematical invariances remain to be explored ... and plenty of work remains to be done! :)</description>
		<content:encoded><![CDATA[<p>Mathematical books that are clear, comprehensive, and inspiring to students obviously are <i>good</i>.  However&#8212;by Bohr&#8217;s Opposites Principle&#8212;it follows that mathematical books that are dismally opaque, grossly incomplete, and hugely intimidating to students, are good too.</p>
<p><i>&#8220;Yeah,&#8221;</i> you&#8217;re thinking <i>&#8220;but what are some examples?  Aside from pretty much everything by Grothendieck, I mean.&#8221;</i></p>
<p>Well, the Clay Mathematical institute has two <a href="http://www.claymath.org/publications/proceedings.php" rel="nofollow">on-line proceedings</a> <i>Strings and Geometry</i>, and <i>Mirror Symmetry</i> that (IMHO) are pretty good examples.</p>
<p>In aggregate, these two proceedings are 1,324 pages of cutting-edge mathematical excellence, in which dozens of mathematicians do their very best to explain to students (and to each other) what&#8217;s going on.</p>
<p>Do they succeed?  Well &#8230; as the <i>Mirror Symmetry</i> introduction candidly describes it:<br />
<blockquote>We are at a delicate point in the history of the interaction of [math and physics]: while both fields desperately need each other, the relationship seems at times to be a dysfunctional codependence rather than a happy marriage!</p></blockquote>
<p>Why would a practical engineer be looking at these two proceedings?  Well, we take a practical interest in the intersection of information theory and geometric quantum mechanics&#8212;that intersection being a working definition of the core mathematics of quantum simulation science.  </p>
<p>So I was keyword-searching for informatic-type concepts like &#8220;decoherence, entanglement, simulation, tensor networks, Choi, Kraus, Stinespring&#8221;.</p>
<p>Zero, zip, nada.   Which is (from one point of view) very <i>good</i> news for students &#8230; because it means that fundamental mathematical invariances remain to be explored &#8230; and plenty of work remains to be done! <img src='http://scottaaronson.com/blog/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Michael Nielsen</title>
		<link>http://scottaaronson.com/blog/?p=384#comment-31639</link>
		<author>Michael Nielsen</author>
		<pubDate>Sun, 08 Feb 2009 01:16:52 +0000</pubDate>
		<guid>http://scottaaronson.com/blog/?p=384#comment-31639</guid>
		<description>Scott - Try Iain Lawrie's "A Grand Unified Tour of Theoretical Physics".  I doubt it's as good as the PCM, given my limited exposure to the PCM, but overall I preferred it to Penrose's book (which is excellent, but uneven).</description>
		<content:encoded><![CDATA[<p>Scott - Try Iain Lawrie&#8217;s &#8220;A Grand Unified Tour of Theoretical Physics&#8221;.  I doubt it&#8217;s as good as the PCM, given my limited exposure to the PCM, but overall I preferred it to Penrose&#8217;s book (which is excellent, but uneven).</p>
]]></content:encoded>
	</item>
</channel>
</rss>
