<?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"
	>
<channel>
	<title>Comments on: Computer Aided Proofs</title>
	<atom:link href="http://dcostanet.net/wordpress/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://dcostanet.net/wordpress/2005/04/03/26/</link>
	<description>Just another WordPress weblog</description>
	<pubDate>Tue, 02 Dec 2008 14:00:29 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.4-bleeding</generator>
		<item>
		<title>By: Administrator</title>
		<link>http://dcostanet.net/wordpress/2005/04/03/26/#comment-2</link>
		<dc:creator>Administrator</dc:creator>
		<pubDate>Sun, 01 May 2005 08:22:50 +0000</pubDate>
		<guid>http://dcostanet.net/wordpress/2005/04/03/26/#comment-2</guid>
		<description>Gentle reader Hemanshu, from his little village in Champaign, points out the 
&lt;a href="http://en.wikipedia.org/wiki/Probabilistically_checkable_proof" rel="nofollow"&gt;PCP theorem&lt;/a&gt; which can be used to detect false statements with as high a probability that you like (less than 1 ofcourse). These are also used to in primality testing, to check whether a number is highly likely to be prime before using it in an encryption scheme.</description>
		<content:encoded><![CDATA[<p>Gentle reader Hemanshu, from his little village in Champaign, points out the<br />
<a href="http://en.wikipedia.org/wiki/Probabilistically_checkable_proof" rel="nofollow">PCP theorem</a> which can be used to detect false statements with as high a probability that you like (less than 1 ofcourse). These are also used to in primality testing, to check whether a number is highly likely to be prime before using it in an encryption scheme.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
