<?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: First we assume a circular CD</title>
	<atom:link href="http://www.scottaaronson.com/blog/?feed=rss2&#038;p=32" rel="self" type="application/rss+xml" />
	<link>http://www.scottaaronson.com/blog/?p=32</link>
	<description>The Blog of Scott Aaronson</description>
	<lastBuildDate>Tue, 21 May 2013 05:38:30 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.5.1</generator>
	<item>
		<title>By: Shtetl-Optimized &#187; Blog Archive &#187; How to rig an election</title>
		<link>http://www.scottaaronson.com/blog/?p=32#comment-547</link>
		<dc:creator>Shtetl-Optimized &#187; Blog Archive &#187; How to rig an election</dc:creator>
		<pubDate>Thu, 21 Dec 2006 18:43:46 +0000</pubDate>
		<guid isPermaLink="false">http://scottaaronson.com/blog/?p=32#comment-547</guid>
		<description><![CDATA[[...] My friend Alex Halderman is now after bigger fish than copy-&#8221;protected&#8221; music CD&#8217;s. Watch this video, in which he, Ed Felten, and Ariel Feldman demonstrate how to rig a Diebold voting machine (and also watch Alex show off his lock-picking skills). Reading the group&#8217;s paper, one becomes painfully aware of a yawning cultural divide between nerds and the rest of the world. Within the nerd universe, that voting machines need to have a verifiable paper trail, that they need to be open to inspection by researchers, etc., are points so obvious as to be scarcely worth stating. If a company (Diebold) refuses to take these most trivial of precautions, then even without a demonstration of the sort Alex et al. provide, the presumption must be that their machines are insecure. Now Alex et al. are trying to take what&#8217;s obvious to nerds into a universe &#8212; local election boards, the courts, etc. &#8212; that operates by entirely different rules. Within this other universe, the burden is not on Diebold to prove its voting machines are secure; it&#8217;s on Alex et al. to prove they&#8217;re insecure. And even if they do prove they&#8217;re insecure &#8212; well, if it weren&#8217;t for those pesky researchers telling the bad guys how to cheat, what would we have to worry about? [...]]]></description>
		<content:encoded><![CDATA[<p>[...] My friend Alex Halderman is now after bigger fish than copy-&#8221;protected&#8221; music CD&#8217;s. Watch this video, in which he, Ed Felten, and Ariel Feldman demonstrate how to rig a Diebold voting machine (and also watch Alex show off his lock-picking skills). Reading the group&#8217;s paper, one becomes painfully aware of a yawning cultural divide between nerds and the rest of the world. Within the nerd universe, that voting machines need to have a verifiable paper trail, that they need to be open to inspection by researchers, etc., are points so obvious as to be scarcely worth stating. If a company (Diebold) refuses to take these most trivial of precautions, then even without a demonstration of the sort Alex et al. provide, the presumption must be that their machines are insecure. Now Alex et al. are trying to take what&#8217;s obvious to nerds into a universe &#8212; local election boards, the courts, etc. &#8212; that operates by entirely different rules. Within this other universe, the burden is not on Diebold to prove its voting machines are secure; it&#8217;s on Alex et al. to prove they&#8217;re insecure. And even if they do prove they&#8217;re insecure &#8212; well, if it weren&#8217;t for those pesky researchers telling the bad guys how to cheat, what would we have to worry about? [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Greg Kuperberg</title>
		<link>http://www.scottaaronson.com/blog/?p=32#comment-546</link>
		<dc:creator>Greg Kuperberg</dc:creator>
		<pubDate>Thu, 17 Nov 2005 21:02:00 +0000</pubDate>
		<guid isPermaLink="false">http://scottaaronson.com/blog/?p=32#comment-546</guid>
		<description><![CDATA[It partly depends on what you mean by a classical state.  An indefinite classical state cannot be copied any more than a quantum state can.

Part of the point is that in quantum theory, all states are indefinite.  Pure states are the most definite, but they are still indefinite.]]></description>
		<content:encoded><![CDATA[<p>It partly depends on what you mean by a classical state.  An indefinite classical state cannot be copied any more than a quantum state can.</p>
<p>Part of the point is that in quantum theory, all states are indefinite.  Pure states are the most definite, but they are still indefinite.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Scott</title>
		<link>http://www.scottaaronson.com/blog/?p=32#comment-545</link>
		<dc:creator>Scott</dc:creator>
		<pubDate>Thu, 17 Nov 2005 05:09:00 +0000</pubDate>
		<guid isPermaLink="false">http://scottaaronson.com/blog/?p=32#comment-545</guid>
		<description><![CDATA[Anonymous: The &quot;no-cloning theorem&quot; says that there&#039;s no way to copy an unknown quantum state (i.e. if you try to duplicate the state, you&#039;ll destroy its quantum coherence).  Indeed, a pure quantum state can be copied if, and only if, it belongs to a known orthogonal basis.  Fortunately, the set of n-bit strings (or in other words, computational basis states) constitutes just such a basis.

All of that was just a fancy, highfalutin&#039; way of saying that classical information (being classical) can be copied!]]></description>
		<content:encoded><![CDATA[<p>Anonymous: The &#8220;no-cloning theorem&#8221; says that there&#8217;s no way to copy an unknown quantum state (i.e. if you try to duplicate the state, you&#8217;ll destroy its quantum coherence).  Indeed, a pure quantum state can be copied if, and only if, it belongs to a known orthogonal basis.  Fortunately, the set of n-bit strings (or in other words, computational basis states) constitutes just such a basis.</p>
<p>All of that was just a fancy, highfalutin&#8217; way of saying that classical information (being classical) can be copied!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anonymous</title>
		<link>http://www.scottaaronson.com/blog/?p=32#comment-544</link>
		<dc:creator>Anonymous</dc:creator>
		<pubDate>Thu, 17 Nov 2005 01:03:00 +0000</pubDate>
		<guid isPermaLink="false">http://scottaaronson.com/blog/?p=32#comment-544</guid>
		<description><![CDATA[Can you tell us a bit more about the implication made in this statement:

&quot;For me, it follows from the fact that the set of n-bit strings constitutes an orthogonal basis for Hilbert space.&quot;

This is yet another instance where I know ever single word (and jargons) in a sentence but I don&#039;t know what the sentence actually means. :P]]></description>
		<content:encoded><![CDATA[<p>Can you tell us a bit more about the implication made in this statement:</p>
<p>&#8220;For me, it follows from the fact that the set of n-bit strings constitutes an orthogonal basis for Hilbert space.&#8221;</p>
<p>This is yet another instance where I know ever single word (and jargons) in a sentence but I don&#8217;t know what the sentence actually means. <img src='http://www.scottaaronson.com/blog/wp-includes/images/smilies/icon_razz.gif' alt=':P' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Scott</title>
		<link>http://www.scottaaronson.com/blog/?p=32#comment-543</link>
		<dc:creator>Scott</dc:creator>
		<pubDate>Wed, 16 Nov 2005 16:25:00 +0000</pubDate>
		<guid isPermaLink="false">http://scottaaronson.com/blog/?p=32#comment-543</guid>
		<description><![CDATA[Eldar: First4Internet and SunnComm &lt;I&gt;both&lt;/I&gt; have new DRM software, with different &quot;innovations.&quot;  The First4Internet one does seem worse security-wise.  But the SunnComm one is easier to explain, and funnier! :)]]></description>
		<content:encoded><![CDATA[<p>Eldar: First4Internet and SunnComm <i>both</i> have new DRM software, with different &#8220;innovations.&#8221;  The First4Internet one does seem worse security-wise.  But the SunnComm one is easier to explain, and funnier! <img src='http://www.scottaaronson.com/blog/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Eldar</title>
		<link>http://www.scottaaronson.com/blog/?p=32#comment-542</link>
		<dc:creator>Eldar</dc:creator>
		<pubDate>Wed, 16 Nov 2005 13:38:00 +0000</pubDate>
		<guid isPermaLink="false">http://scottaaronson.com/blog/?p=32#comment-542</guid>
		<description><![CDATA[To set the record straight, the new DRM software is by First4Internet, not SunnComm. It&#039;s crown jewel &quot;feature&quot; is a generic rootkit (read that &quot;trojan&quot;) that makes your system unable to see or delete certain files on the disk. In the spirit of free commerce there seems to be already 3rd party malware that taps this crippling of your system. A bit little and too late, Sony is now making steps to contain the damage, as this one has the potential to be the one that backfires at them.

One more thing for the irony - there are allegations that the DRM software has copyright violations in its own code, as it incoporates pieces of Free Software projects whose license does not allow this mode of distribution.

By the way, I should state that I am not in the inner loop myself - the above is from what I read over the net.]]></description>
		<content:encoded><![CDATA[<p>To set the record straight, the new DRM software is by First4Internet, not SunnComm. It&#8217;s crown jewel &#8220;feature&#8221; is a generic rootkit (read that &#8220;trojan&#8221;) that makes your system unable to see or delete certain files on the disk. In the spirit of free commerce there seems to be already 3rd party malware that taps this crippling of your system. A bit little and too late, Sony is now making steps to contain the damage, as this one has the potential to be the one that backfires at them.</p>
<p>One more thing for the irony &#8211; there are allegations that the DRM software has copyright violations in its own code, as it incoporates pieces of Free Software projects whose license does not allow this mode of distribution.</p>
<p>By the way, I should state that I am not in the inner loop myself &#8211; the above is from what I read over the net.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Luca</title>
		<link>http://www.scottaaronson.com/blog/?p=32#comment-541</link>
		<dc:creator>Luca</dc:creator>
		<pubDate>Wed, 16 Nov 2005 10:05:00 +0000</pubDate>
		<guid isPermaLink="false">http://scottaaronson.com/blog/?p=32#comment-541</guid>
		<description><![CDATA[Erdos had this story of how he &quot;independently discovered&quot; negative numbers when he was four.]]></description>
		<content:encoded><![CDATA[<p>Erdos had this story of how he &#8220;independently discovered&#8221; negative numbers when he was four.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Scott</title>
		<link>http://www.scottaaronson.com/blog/?p=32#comment-540</link>
		<dc:creator>Scott</dc:creator>
		<pubDate>Wed, 16 Nov 2005 08:37:00 +0000</pubDate>
		<guid isPermaLink="false">http://scottaaronson.com/blog/?p=32#comment-540</guid>
		<description><![CDATA[&quot;I wonder how often do kids reinvent things?&quot;

My guess: far more often than most people think! The best researcher would be someone with the knowledge, confidence, and intellectual honesty that come from decades of experience, but the brain of an 11-year-old.

PS. Of course, Heisenberg&#039;s principle deals with the &lt;I&gt;product&lt;/I&gt; of uncertainties of a pair of noncommuting observables, not with the disturbance to any one of them caused by measurement. :-)]]></description>
		<content:encoded><![CDATA[<p>&#8220;I wonder how often do kids reinvent things?&#8221;</p>
<p>My guess: far more often than most people think! The best researcher would be someone with the knowledge, confidence, and intellectual honesty that come from decades of experience, but the brain of an 11-year-old.</p>
<p>PS. Of course, Heisenberg&#8217;s principle deals with the <i>product</i> of uncertainties of a pair of noncommuting observables, not with the disturbance to any one of them caused by measurement. <img src='http://www.scottaaronson.com/blog/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anonymous</title>
		<link>http://www.scottaaronson.com/blog/?p=32#comment-539</link>
		<dc:creator>Anonymous</dc:creator>
		<pubDate>Wed, 16 Nov 2005 08:17:00 +0000</pubDate>
		<guid isPermaLink="false">http://scottaaronson.com/blog/?p=32#comment-539</guid>
		<description><![CDATA[Ah...well I would not have been able to understand the calculus even if I had access to the book since I didn&#039;t even know about algebra in the 7th grade.

I wonder how often do kids reinvent things? When I was a child it seemed obvious to me that if you tried to &quot;look at&quot; or measure elementary particles that you would change their position/momentum simply by interacting with them. I remember my disappointment when I found out that Heisenberg had already discovered the Uncertainty Principle! :)]]></description>
		<content:encoded><![CDATA[<p>Ah&#8230;well I would not have been able to understand the calculus even if I had access to the book since I didn&#8217;t even know about algebra in the 7th grade.</p>
<p>I wonder how often do kids reinvent things? When I was a child it seemed obvious to me that if you tried to &#8220;look at&#8221; or measure elementary particles that you would change their position/momentum simply by interacting with them. I remember my disappointment when I found out that Heisenberg had already discovered the Uncertainty Principle! <img src='http://www.scottaaronson.com/blog/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Scott</title>
		<link>http://www.scottaaronson.com/blog/?p=32#comment-538</link>
		<dc:creator>Scott</dc:creator>
		<pubDate>Wed, 16 Nov 2005 07:55:00 +0000</pubDate>
		<guid isPermaLink="false">http://scottaaronson.com/blog/?p=32#comment-538</guid>
		<description><![CDATA[Anonymous: The summer between 6th and 7th grades, my brother had a babysitter who&#039;d taken calculus in college.  She gave me her textbook, and I read as much of it as I could.

A few years before that, I&#039;d invented a new field called &quot;graph analysis,&quot; which I was sure would revolutionize the world.  Given a sequence of numbers, the idea was to find the &quot;rate of change,&quot; &quot;rate of change of the rate of change,&quot; etc. by taking successive differences between entries, like so:

6 4 7 8 1
-2 3 1 -7
5 -2 -8
-7 -6

You could also reverse that operation by taking cumulative sums.  It was a big disappointment to learn that Newton and Leibniz had already done this for continuous functions, which is the nontrivial part! :)

Anyway, you&#039;re lucky to have had a good programming instructor as a kid.  That class sounds awesome.]]></description>
		<content:encoded><![CDATA[<p>Anonymous: The summer between 6th and 7th grades, my brother had a babysitter who&#8217;d taken calculus in college.  She gave me her textbook, and I read as much of it as I could.</p>
<p>A few years before that, I&#8217;d invented a new field called &#8220;graph analysis,&#8221; which I was sure would revolutionize the world.  Given a sequence of numbers, the idea was to find the &#8220;rate of change,&#8221; &#8220;rate of change of the rate of change,&#8221; etc. by taking successive differences between entries, like so:</p>
<p>6 4 7 8 1<br />
-2 3 1 -7<br />
5 -2 -8<br />
-7 -6</p>
<p>You could also reverse that operation by taking cumulative sums.  It was a big disappointment to learn that Newton and Leibniz had already done this for continuous functions, which is the nontrivial part! <img src='http://www.scottaaronson.com/blog/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
<p>Anyway, you&#8217;re lucky to have had a good programming instructor as a kid.  That class sounds awesome.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
