<?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: Ten Signs a Claimed Mathematical Breakthrough is Wrong</title>
	<atom:link href="http://www.scottaaronson.com/blog/?feed=rss2&#038;p=304" rel="self" type="application/rss+xml" />
	<link>http://www.scottaaronson.com/blog/?p=304</link>
	<description>The Blog of Scott Aaronson</description>
	<lastBuildDate>Sun, 19 May 2013 08:00:44 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.5.1</generator>
	<item>
		<title>By: Anonymous</title>
		<link>http://www.scottaaronson.com/blog/?p=304#comment-9031</link>
		<dc:creator>Anonymous</dc:creator>
		<pubDate>Sun, 10 Feb 2008 08:30:31 +0000</pubDate>
		<guid isPermaLink="false">http://scottaaronson.com/blog/?p=304#comment-9031</guid>
		<description><![CDATA[&lt;i&gt;Isn’t it narrow-minded and constrictive to say that any proposal that is not presented in TeX is not worthy of consideration?&lt;/i&gt; ... &lt;i&gt;To judge every thought by whether it is presented in TeX is stifling.&lt;/i&gt;

Nobody&#039;s saying the use of TeX is a fully reliable test for whether a paper is good, but here&#039;s an analogy:

Suppose someone handwrites a paper in crayon.  Logically, this tells us nothing about the content of the paper, but in practice, it tells us a lot about the author.  Very few people who write in crayon have anything interesting or worthwhile to say.  It&#039;s not a logical guarantee, but if you see a research paper written in crayon, it&#039;s perfectly reasonable not to take it seriously (since it almost certainly isn&#039;t serious).

Not using TeX in a math/CS paper is not nearly as extreme as writing in crayon, but it is similar in spirit.  There are a handful of older or eccentric researchers who have never learned TeX.  Other than that, anybody in math or theoretical CS who doesn&#039;t use TeX looks like a rube.  This may not be fair, but it&#039;s a true statement about appearances within the community.]]></description>
		<content:encoded><![CDATA[<p><i>Isn’t it narrow-minded and constrictive to say that any proposal that is not presented in TeX is not worthy of consideration?</i> &#8230; <i>To judge every thought by whether it is presented in TeX is stifling.</i></p>
<p>Nobody&#8217;s saying the use of TeX is a fully reliable test for whether a paper is good, but here&#8217;s an analogy:</p>
<p>Suppose someone handwrites a paper in crayon.  Logically, this tells us nothing about the content of the paper, but in practice, it tells us a lot about the author.  Very few people who write in crayon have anything interesting or worthwhile to say.  It&#8217;s not a logical guarantee, but if you see a research paper written in crayon, it&#8217;s perfectly reasonable not to take it seriously (since it almost certainly isn&#8217;t serious).</p>
<p>Not using TeX in a math/CS paper is not nearly as extreme as writing in crayon, but it is similar in spirit.  There are a handful of older or eccentric researchers who have never learned TeX.  Other than that, anybody in math or theoretical CS who doesn&#8217;t use TeX looks like a rube.  This may not be fair, but it&#8217;s a true statement about appearances within the community.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: asdf</title>
		<link>http://www.scottaaronson.com/blog/?p=304#comment-9030</link>
		<dc:creator>asdf</dc:creator>
		<pubDate>Sun, 10 Feb 2008 01:59:37 +0000</pubDate>
		<guid isPermaLink="false">http://scottaaronson.com/blog/?p=304#comment-9030</guid>
		<description><![CDATA[What can I say; if a paper is full of spelling errors, that doesn&#039;t necessarily mean the mathematical content is wrong, but it&#039;s not a good sign.  TeX is part of mathematical culture and using anything else might be similar to using an unconventional notation for a familiar math concept.  Again, not conclusive, but not a good sign.  Nothing short of actually reading a paper (or at least reading enough to find a definite error) is enough to form a conclusive judgement of its content.  But lots of things, like the presence or absence of spelling errors and weird notation and typography, can raise or lower expectations at the outset.  That I think is what Scott was trying to get at.]]></description>
		<content:encoded><![CDATA[<p>What can I say; if a paper is full of spelling errors, that doesn&#8217;t necessarily mean the mathematical content is wrong, but it&#8217;s not a good sign.  TeX is part of mathematical culture and using anything else might be similar to using an unconventional notation for a familiar math concept.  Again, not conclusive, but not a good sign.  Nothing short of actually reading a paper (or at least reading enough to find a definite error) is enough to form a conclusive judgement of its content.  But lots of things, like the presence or absence of spelling errors and weird notation and typography, can raise or lower expectations at the outset.  That I think is what Scott was trying to get at.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Craig</title>
		<link>http://www.scottaaronson.com/blog/?p=304#comment-9029</link>
		<dc:creator>Craig</dc:creator>
		<pubDate>Sat, 09 Feb 2008 18:18:04 +0000</pubDate>
		<guid isPermaLink="false">http://scottaaronson.com/blog/?p=304#comment-9029</guid>
		<description><![CDATA[asdf - To date, I&#039;m using remarkably few equations.  If I were using more, TeX-ware would be of greater value to me, but as it is, it seems to be one more thing to install and learn.  Doing so just to placate people who think everyone should do things the same way rubs me the wrong way.

Apart from facilitating the typesetting of equations, are there compelling reasons for someone to use TeX who will not be submitting papers to journals?]]></description>
		<content:encoded><![CDATA[<p>asdf &#8211; To date, I&#8217;m using remarkably few equations.  If I were using more, TeX-ware would be of greater value to me, but as it is, it seems to be one more thing to install and learn.  Doing so just to placate people who think everyone should do things the same way rubs me the wrong way.</p>
<p>Apart from facilitating the typesetting of equations, are there compelling reasons for someone to use TeX who will not be submitting papers to journals?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: asdf</title>
		<link>http://www.scottaaronson.com/blog/?p=304#comment-9028</link>
		<dc:creator>asdf</dc:creator>
		<pubDate>Sat, 09 Feb 2008 10:54:51 +0000</pubDate>
		<guid isPermaLink="false">http://scottaaronson.com/blog/?p=304#comment-9028</guid>
		<description><![CDATA[Re provability in PA: the graph minor theorem demonstrably is not provable in PA, though it&#039;s provable in second order arithmetic (probably in some weak fragment).  It certainly sounds plausible to me that P vs NP is independent of PA but can be solved in PA2.  Set theory (ZFC) is something else again, and it would be awful if solving P vs NP needed it.

Craig, it wouldn&#039;t occur to me to use a word processor to format a math paper, because of how messy it would be to enter the equations.  With TeX you type them pretty much the way you would read them out loud.]]></description>
		<content:encoded><![CDATA[<p>Re provability in PA: the graph minor theorem demonstrably is not provable in PA, though it&#8217;s provable in second order arithmetic (probably in some weak fragment).  It certainly sounds plausible to me that P vs NP is independent of PA but can be solved in PA2.  Set theory (ZFC) is something else again, and it would be awful if solving P vs NP needed it.</p>
<p>Craig, it wouldn&#8217;t occur to me to use a word processor to format a math paper, because of how messy it would be to enter the equations.  With TeX you type them pretty much the way you would read them out loud.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Craig</title>
		<link>http://www.scottaaronson.com/blog/?p=304#comment-9027</link>
		<dc:creator>Craig</dc:creator>
		<pubDate>Sat, 09 Feb 2008 08:17:38 +0000</pubDate>
		<guid isPermaLink="false">http://scottaaronson.com/blog/?p=304#comment-9027</guid>
		<description><![CDATA[I left academe 13 years ago and have been doing research quietly and steadily while earning a living by other means.  Most of my work involves the development of algorithms for challenging problems, especially problems in graph theory.  My working set of problems includes Graph Isomorphism, Subgraph Isomorphism, Maximal Cliques, Maximum Cliques, k-Clique Existence, and Factoring.

I&#039;m partially shifting into a writing mode so that I can get a lot of work out of my head, software, and notes and into the world.  In particular, I have several new algorithms for Graph Isomorpism, Maximal Cliques, Maximum Cliques, and k-Clique Existence that are ready to share.

I have published none of my work beyond my dissertation, so we&#039;re talking about 20 years of research that I need to organize and write up.  I believe that some of my work will be of interest.  I have no interest in publishing in journals.  I plan on posting papers on ArXiv or the ACM equivalent.

I haven&#039;t been planning on making source code available - a lot of work would be required to prepare it and maintain it that I think could be better spent.  I haven&#039;t ruled this out, though.

Call me unconventional or attribute it to a personality quirk.  I&#039;m hoping that my work will be taken seriously but I&#039;m not overly concerned that it might set off an occasional alarm on first exposure.

I hadn&#039;t thought seriously about learning TeX or how to use TeX-related tools until reading this blog entry.  I&#039;ve been planning on posting in PDF to an archive.  I have very little need for the typesetting capabilities that TeX offers.  I&#039;m inclined to skipping TeX and using a conventional word-processor to generate PDF.

Comments and suggestions on my situation and plans are most welcome.]]></description>
		<content:encoded><![CDATA[<p>I left academe 13 years ago and have been doing research quietly and steadily while earning a living by other means.  Most of my work involves the development of algorithms for challenging problems, especially problems in graph theory.  My working set of problems includes Graph Isomorphism, Subgraph Isomorphism, Maximal Cliques, Maximum Cliques, k-Clique Existence, and Factoring.</p>
<p>I&#8217;m partially shifting into a writing mode so that I can get a lot of work out of my head, software, and notes and into the world.  In particular, I have several new algorithms for Graph Isomorpism, Maximal Cliques, Maximum Cliques, and k-Clique Existence that are ready to share.</p>
<p>I have published none of my work beyond my dissertation, so we&#8217;re talking about 20 years of research that I need to organize and write up.  I believe that some of my work will be of interest.  I have no interest in publishing in journals.  I plan on posting papers on ArXiv or the ACM equivalent.</p>
<p>I haven&#8217;t been planning on making source code available &#8211; a lot of work would be required to prepare it and maintain it that I think could be better spent.  I haven&#8217;t ruled this out, though.</p>
<p>Call me unconventional or attribute it to a personality quirk.  I&#8217;m hoping that my work will be taken seriously but I&#8217;m not overly concerned that it might set off an occasional alarm on first exposure.</p>
<p>I hadn&#8217;t thought seriously about learning TeX or how to use TeX-related tools until reading this blog entry.  I&#8217;ve been planning on posting in PDF to an archive.  I have very little need for the typesetting capabilities that TeX offers.  I&#8217;m inclined to skipping TeX and using a conventional word-processor to generate PDF.</p>
<p>Comments and suggestions on my situation and plans are most welcome.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Navajo mathematician</title>
		<link>http://www.scottaaronson.com/blog/?p=304#comment-9026</link>
		<dc:creator>Navajo mathematician</dc:creator>
		<pubDate>Wed, 23 Jan 2008 03:26:56 +0000</pubDate>
		<guid isPermaLink="false">http://scottaaronson.com/blog/?p=304#comment-9026</guid>
		<description><![CDATA[Senge Tame!
1.
This affair explains why mathematicians need to learn
some basics of complexity: proving that some thing
is &quot;hard&quot; gives semi-rigorous, conditional
proof of impossibility of &quot;simple&quot; descriptions of the thing.
In other words, it provides implicit counter-examples.
And this strategy is very kosher when indecidability is used.
2. The &quot;mathematical&quot; situation here is very common:
Given a set X, with &quot;easy&quot; membership for its convex hull
CO(X). Is the membership for the convex
hull CO(X \otimes X) &quot;easy&quot;?
Quite often the answer is negative. The good example
for this &quot;quantum&quot; blog is the separability/entanglement
problem. I wonder if there exists some general
statement of the sort?]]></description>
		<content:encoded><![CDATA[<p>Senge Tame!<br />
1.<br />
This affair explains why mathematicians need to learn<br />
some basics of complexity: proving that some thing<br />
is &#8220;hard&#8221; gives semi-rigorous, conditional<br />
proof of impossibility of &#8220;simple&#8221; descriptions of the thing.<br />
In other words, it provides implicit counter-examples.<br />
And this strategy is very kosher when indecidability is used.<br />
2. The &#8220;mathematical&#8221; situation here is very common:<br />
Given a set X, with &#8220;easy&#8221; membership for its convex hull<br />
CO(X). Is the membership for the convex<br />
hull CO(X \otimes X) &#8220;easy&#8221;?<br />
Quite often the answer is negative. The good example<br />
for this &#8220;quantum&#8221; blog is the separability/entanglement<br />
problem. I wonder if there exists some general<br />
statement of the sort?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: D'Aundray Bullock</title>
		<link>http://www.scottaaronson.com/blog/?p=304#comment-9025</link>
		<dc:creator>D'Aundray Bullock</dc:creator>
		<pubDate>Mon, 14 Jan 2008 02:42:20 +0000</pubDate>
		<guid isPermaLink="false">http://scottaaronson.com/blog/?p=304#comment-9025</guid>
		<description><![CDATA[Isn&#039;t it narrow-minded and constrictive to say that any proposal that is not presented in TeX is not worthy of consideration? If new ideas were judged by their adherence to conventional or restricted form, then men such as Grassmann, Frege, and Feynman would have been ignored, to our detriment. A creative idea can be as well presented in Baskerville or Times New Roman as in TeX. It is the content of the idea that is important, not the form. To judge every thought by whether it is presented in TeX is stifling.]]></description>
		<content:encoded><![CDATA[<p>Isn&#8217;t it narrow-minded and constrictive to say that any proposal that is not presented in TeX is not worthy of consideration? If new ideas were judged by their adherence to conventional or restricted form, then men such as Grassmann, Frege, and Feynman would have been ignored, to our detriment. A creative idea can be as well presented in Baskerville or Times New Roman as in TeX. It is the content of the idea that is important, not the form. To judge every thought by whether it is presented in TeX is stifling.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: AuggieDoggie</title>
		<link>http://www.scottaaronson.com/blog/?p=304#comment-9024</link>
		<dc:creator>AuggieDoggie</dc:creator>
		<pubDate>Fri, 11 Jan 2008 21:48:38 +0000</pubDate>
		<guid isPermaLink="false">http://scottaaronson.com/blog/?p=304#comment-9024</guid>
		<description><![CDATA[Friedland has posted a 3rd version that better incorporates the feedback of Babai &amp; other researchers @

   http://arxiv.org/abs/0801.0398]]></description>
		<content:encoded><![CDATA[<p>Friedland has posted a 3rd version that better incorporates the feedback of Babai &amp; other researchers @</p>
<p>   <a href="http://arxiv.org/abs/0801.0398" rel="nofollow">http://arxiv.org/abs/0801.0398</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Job</title>
		<link>http://www.scottaaronson.com/blog/?p=304#comment-9023</link>
		<dc:creator>Job</dc:creator>
		<pubDate>Fri, 11 Jan 2008 03:51:36 +0000</pubDate>
		<guid isPermaLink="false">http://scottaaronson.com/blog/?p=304#comment-9023</guid>
		<description><![CDATA[Which problem do you think resembles GI the most: Primality Testing or Factoring? Why?]]></description>
		<content:encoded><![CDATA[<p>Which problem do you think resembles GI the most: Primality Testing or Factoring? Why?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Daniel</title>
		<link>http://www.scottaaronson.com/blog/?p=304#comment-9022</link>
		<dc:creator>Daniel</dc:creator>
		<pubDate>Thu, 10 Jan 2008 01:33:34 +0000</pubDate>
		<guid isPermaLink="false">http://scottaaronson.com/blog/?p=304#comment-9022</guid>
		<description><![CDATA[I asked Laci Babai about the canonical form question. He wrote that

1. Job&#039;s &quot;graph hash&quot; is called &quot;complete invariant&quot; in the literature.
2. complete invariants in P imply canonical forms in P, so my &quot;ugly world&quot; is ruled out. The elementary two-page proof is in:

http://research.microsoft.com/~gurevich/Opera/131.pdf

3. GI in P is not known to imply complete invariants in P.]]></description>
		<content:encoded><![CDATA[<p>I asked Laci Babai about the canonical form question. He wrote that</p>
<p>1. Job&#8217;s &#8220;graph hash&#8221; is called &#8220;complete invariant&#8221; in the literature.<br />
2. complete invariants in P imply canonical forms in P, so my &#8220;ugly world&#8221; is ruled out. The elementary two-page proof is in:</p>
<p><a href="http://research.microsoft.com/~gurevich/Opera/131.pdf" rel="nofollow">http://research.microsoft.com/~gurevich/Opera/131.pdf</a></p>
<p>3. GI in P is not known to imply complete invariants in P.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
