<article>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#article09_06_13_2218226</id>
	<title>47th Mersenne Prime Confirmed</title>
	<author>kdawson</author>
	<datestamp>1244890440000</datestamp>
	<htmltext><a href="http://artisthero.com/" rel="nofollow">radiot88</a> writes to let us know that he heard a confirmation of the discovery of the <a href="http://mersenne.org/">47th known Mersenne Prime</a> on NPR's Science Friday (<a href="http://www.npr.org/templates/player/mediaPlayer.html?action=1&amp;t=1&amp;islist=false&amp;id=105344283&amp;m=105310408">audio here</a>). The new prime, 2^42,643,801 - 1, is actually smaller than the one discovered previously. It was <i>"found by Odd Magnar Strindmo from Melhus, Norway. This prime is the second largest known prime number, a 'mere' 141,125 digits smaller than the Mersenne prime found last August. Odd is an IT professional whose computers have been working with GIMPS since 1996 testing over 1,400 candidates. This calculation took 29 days on a 3.0 GHz Intel Core2 processor. The prime was independently verified June 12th by Tony Reix of Bull SAS in Grenoble, France..."</i></htmltext>
<tokenext>radiot88 writes to let us know that he heard a confirmation of the discovery of the 47th known Mersenne Prime on NPR 's Science Friday ( audio here ) .
The new prime , 2 ^ 42,643,801 - 1 , is actually smaller than the one discovered previously .
It was " found by Odd Magnar Strindmo from Melhus , Norway .
This prime is the second largest known prime number , a 'mere ' 141,125 digits smaller than the Mersenne prime found last August .
Odd is an IT professional whose computers have been working with GIMPS since 1996 testing over 1,400 candidates .
This calculation took 29 days on a 3.0 GHz Intel Core2 processor .
The prime was independently verified June 12th by Tony Reix of Bull SAS in Grenoble , France... "</tokentext>
<sentencetext>radiot88 writes to let us know that he heard a confirmation of the discovery of the 47th known Mersenne Prime on NPR's Science Friday (audio here).
The new prime, 2^42,643,801 - 1, is actually smaller than the one discovered previously.
It was "found by Odd Magnar Strindmo from Melhus, Norway.
This prime is the second largest known prime number, a 'mere' 141,125 digits smaller than the Mersenne prime found last August.
Odd is an IT professional whose computers have been working with GIMPS since 1996 testing over 1,400 candidates.
This calculation took 29 days on a 3.0 GHz Intel Core2 processor.
The prime was independently verified June 12th by Tony Reix of Bull SAS in Grenoble, France..."</sentencetext>
</article>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323335</id>
	<title>Hmm</title>
	<author>Anonymous</author>
	<datestamp>1244896560000</datestamp>
	<modclass>Informativ</modclass>
	<modscore>3</modscore>
	<htmltext><p>I honestly forget why I'm supposed to care about Mersenne primes. Like, I read something about them awhile back, it was somewhat interesting... and then--yeah. So:</p><p><a href="http://en.wikipedia.org/wiki/Mersenne\_prime" title="wikipedia.org">http://en.wikipedia.org/wiki/Mersenne\_prime</a> [wikipedia.org]<br>In mathematics, a Mersenne number is a positive integer that is one less than a power of two.</p><p>A Mersenne prime is a Mersenne number that is prime. As of June 2009[ref], only 47 Mersenne primes are known; the largest known prime number (243,112,609  1) is a Mersenne prime, and in modern times, the largest known prime has almost always been a Mersenne prime.[1] Like several previously-discovered Mersenne primes, it was discovered by a distributed computing project on the Internet, known as the Great Internet Mersenne Prime Search (GIMPS). It was the first known prime number with more than 10 million base-10 digits.</p><p>For those who can't even remember what a prime is, it's a number that can only be divided (evenly) by 1 and itself. Here's a list of the first primes: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97</p><p>The Mersenne primes are the largest known primes.</p><p>Prime numbers have applications in electronic security and encryption breaking. I'm not sure what other purpose there is to knowing them, other than knowing them. The Mersenne in particular seem to be merely mathematical curiosities right now.</p><p>I was much more excited by the discovery that the the Fibonnacci sequence is contained within the 1/89 calculation.<br><a href="http://www.geom.uiuc.edu/~rminer/1over89/" title="uiuc.edu">http://www.geom.uiuc.edu/~rminer/1over89/</a> [uiuc.edu]</p></htmltext>
<tokenext>I honestly forget why I 'm supposed to care about Mersenne primes .
Like , I read something about them awhile back , it was somewhat interesting... and then--yeah .
So : http : //en.wikipedia.org/wiki/Mersenne \ _prime [ wikipedia.org ] In mathematics , a Mersenne number is a positive integer that is one less than a power of two.A Mersenne prime is a Mersenne number that is prime .
As of June 2009 [ ref ] , only 47 Mersenne primes are known ; the largest known prime number ( 243,112,609 1 ) is a Mersenne prime , and in modern times , the largest known prime has almost always been a Mersenne prime .
[ 1 ] Like several previously-discovered Mersenne primes , it was discovered by a distributed computing project on the Internet , known as the Great Internet Mersenne Prime Search ( GIMPS ) .
It was the first known prime number with more than 10 million base-10 digits.For those who ca n't even remember what a prime is , it 's a number that can only be divided ( evenly ) by 1 and itself .
Here 's a list of the first primes : 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 , 31 , 37 , 41 , 43 , 47 , 53 , 59 , 61 , 67 , 71 , 73 , 79 , 83 , 89 , 97The Mersenne primes are the largest known primes.Prime numbers have applications in electronic security and encryption breaking .
I 'm not sure what other purpose there is to knowing them , other than knowing them .
The Mersenne in particular seem to be merely mathematical curiosities right now.I was much more excited by the discovery that the the Fibonnacci sequence is contained within the 1/89 calculation.http : //www.geom.uiuc.edu/ ~ rminer/1over89/ [ uiuc.edu ]</tokentext>
<sentencetext>I honestly forget why I'm supposed to care about Mersenne primes.
Like, I read something about them awhile back, it was somewhat interesting... and then--yeah.
So:http://en.wikipedia.org/wiki/Mersenne\_prime [wikipedia.org]In mathematics, a Mersenne number is a positive integer that is one less than a power of two.A Mersenne prime is a Mersenne number that is prime.
As of June 2009[ref], only 47 Mersenne primes are known; the largest known prime number (243,112,609  1) is a Mersenne prime, and in modern times, the largest known prime has almost always been a Mersenne prime.
[1] Like several previously-discovered Mersenne primes, it was discovered by a distributed computing project on the Internet, known as the Great Internet Mersenne Prime Search (GIMPS).
It was the first known prime number with more than 10 million base-10 digits.For those who can't even remember what a prime is, it's a number that can only be divided (evenly) by 1 and itself.
Here's a list of the first primes: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97The Mersenne primes are the largest known primes.Prime numbers have applications in electronic security and encryption breaking.
I'm not sure what other purpose there is to knowing them, other than knowing them.
The Mersenne in particular seem to be merely mathematical curiosities right now.I was much more excited by the discovery that the the Fibonnacci sequence is contained within the 1/89 calculation.http://www.geom.uiuc.edu/~rminer/1over89/ [uiuc.edu]</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28332499</id>
	<title>English name, and other forms of the new Mersenne</title>
	<author>chongo</author>
	<datestamp>1245009060000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>The link on the <a href="http://mersenne.org/" title="mersenne.org">GIMPS home page</a> [mersenne.org] points to where one may obtain the <a href="http://prime.isthe.com/chongo/tech/math/prime/m42643801/prime-c.html" title="isthe.com">decimal digits of the new Mersenne Prime</a> [isthe.com].  Other forms of <a href="http://www.isthe.com/chongo/tech/math/prime/mersenne.html#M42643801" title="isthe.com">this prime are available</a> [isthe.com]:
<ul>
<li> Digits of 2^42643801 - 1 <a href="http://prime.isthe.com/chongo/tech/math/prime/m42643801/prime-c-e.html" title="isthe.com">with dot separators</a> [isthe.com] (instead of commas)</li>
<li> English name of 2^42643801 - 1 using the <a href="http://prime.isthe.com/chongo/tech/math/prime/m42643801/prime.html" title="isthe.com">American system</a> [isthe.com]</li>
<li> English name of 2^42643801 - 1 using the <a href="http://prime.isthe.com/chongo/tech/math/prime/m42643801/prime-e.html" title="isthe.com">European system</a> [isthe.com]</li>
<li> English name of 2^42643801 - 1 using the <a href="http://prime.isthe.com/chongo/tech/math/prime/m42643801/prime-d.html" title="isthe.com">American system with dashes</a> [isthe.com]</li>
<li> English name of 2^42643801 - 1 using the <a href="http://prime.isthe.com/chongo/tech/math/prime/m42643801/prime-d-e.html" title="isthe.com">European system with dashes</a> [isthe.com]</li>
</ul><p>
The dashed form of the English name is available at assist those who might actually want to read all or part of the +324 Megabyte name.<nobr> <wbr></nobr>:-)</p></htmltext>
<tokenext>The link on the GIMPS home page [ mersenne.org ] points to where one may obtain the decimal digits of the new Mersenne Prime [ isthe.com ] .
Other forms of this prime are available [ isthe.com ] : Digits of 2 ^ 42643801 - 1 with dot separators [ isthe.com ] ( instead of commas ) English name of 2 ^ 42643801 - 1 using the American system [ isthe.com ] English name of 2 ^ 42643801 - 1 using the European system [ isthe.com ] English name of 2 ^ 42643801 - 1 using the American system with dashes [ isthe.com ] English name of 2 ^ 42643801 - 1 using the European system with dashes [ isthe.com ] The dashed form of the English name is available at assist those who might actually want to read all or part of the + 324 Megabyte name .
: - )</tokentext>
<sentencetext>The link on the GIMPS home page [mersenne.org] points to where one may obtain the decimal digits of the new Mersenne Prime [isthe.com].
Other forms of this prime are available [isthe.com]:

 Digits of 2^42643801 - 1 with dot separators [isthe.com] (instead of commas)
 English name of 2^42643801 - 1 using the American system [isthe.com]
 English name of 2^42643801 - 1 using the European system [isthe.com]
 English name of 2^42643801 - 1 using the American system with dashes [isthe.com]
 English name of 2^42643801 - 1 using the European system with dashes [isthe.com]

The dashed form of the English name is available at assist those who might actually want to read all or part of the +324 Megabyte name.
:-)</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323325</id>
	<title>Buggers.</title>
	<author>2*2*3*75011</author>
	<datestamp>1244896500000</datestamp>
	<modclass>None</modclass>
	<modscore>-1</modscore>
	<htmltext>My super-strong RSA encryption modulus was (2^43,112,609-1)*(2^42,643,801-1) and now it's broken. So much for 85,756,410-bit encryption.</htmltext>
<tokenext>My super-strong RSA encryption modulus was ( 2 ^ 43,112,609-1 ) * ( 2 ^ 42,643,801-1 ) and now it 's broken .
So much for 85,756,410-bit encryption .</tokentext>
<sentencetext>My super-strong RSA encryption modulus was (2^43,112,609-1)*(2^42,643,801-1) and now it's broken.
So much for 85,756,410-bit encryption.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323155</id>
	<title>Odd's prime</title>
	<author>fph il quozientatore</author>
	<datestamp>1244894760000</datestamp>
	<modclass>Funny</modclass>
	<modscore>5</modscore>
	<htmltext>So, all primes greater than two are odd, but only one of them is Odd's!</htmltext>
<tokenext>So , all primes greater than two are odd , but only one of them is Odd 's !</tokentext>
<sentencetext>So, all primes greater than two are odd, but only one of them is Odd's!</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323575</id>
	<title>Re:Odd's prime</title>
	<author>Anonymous</author>
	<datestamp>1244899080000</datestamp>
	<modclass>Funny</modclass>
	<modscore>5</modscore>
	<htmltext>His brother, Even Magnar Strindmo, is also an IT professional. Even, like his brother Odd, has been testing candidates since 1996. The latest candidate in Even's search was 2^42,643,801-2, which was found to be composite. The very next number, 2^42,643,801-1, was the one his brother found to be prime.  "Yeah, it kind of hurts to get so close and not be the one who got it," admits Even, "but I gave it my best game. We agreed back in '96 that we'd split up the work and go even-odd. I guess it was just a matter of luck that he got the first prime. I'm going to keep on trying, though. He's ahead now, 1-0, but if we keep going, I figure at some point I'll pull ahead."</htmltext>
<tokenext>His brother , Even Magnar Strindmo , is also an IT professional .
Even , like his brother Odd , has been testing candidates since 1996 .
The latest candidate in Even 's search was 2 ^ 42,643,801-2 , which was found to be composite .
The very next number , 2 ^ 42,643,801-1 , was the one his brother found to be prime .
" Yeah , it kind of hurts to get so close and not be the one who got it , " admits Even , " but I gave it my best game .
We agreed back in '96 that we 'd split up the work and go even-odd .
I guess it was just a matter of luck that he got the first prime .
I 'm going to keep on trying , though .
He 's ahead now , 1-0 , but if we keep going , I figure at some point I 'll pull ahead .
"</tokentext>
<sentencetext>His brother, Even Magnar Strindmo, is also an IT professional.
Even, like his brother Odd, has been testing candidates since 1996.
The latest candidate in Even's search was 2^42,643,801-2, which was found to be composite.
The very next number, 2^42,643,801-1, was the one his brother found to be prime.
"Yeah, it kind of hurts to get so close and not be the one who got it," admits Even, "but I gave it my best game.
We agreed back in '96 that we'd split up the work and go even-odd.
I guess it was just a matter of luck that he got the first prime.
I'm going to keep on trying, though.
He's ahead now, 1-0, but if we keep going, I figure at some point I'll pull ahead.
"</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323155</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28325795</id>
	<title>Re:Hmm</title>
	<author>Bart Coppens</author>
	<datestamp>1244984040000</datestamp>
	<modclass>Interestin</modclass>
	<modscore>2</modscore>
	<htmltext>Actually, you can apparently use larger Mersenne Primes to improve results in totally different but very useful fields, like privacy-related schemes. For example, this paper <a href="http://eccc.hpi-web.de/eccc-reports/2006/TR06-127/index.html" title="hpi-web.de" rel="nofollow">http://eccc.hpi-web.de/eccc-reports/2006/TR06-127/index.html</a> [hpi-web.de] uses large Mersenne primes to get interesting results on Locally Decodable Codes and Private Information Retrieval Schemes...</htmltext>
<tokenext>Actually , you can apparently use larger Mersenne Primes to improve results in totally different but very useful fields , like privacy-related schemes .
For example , this paper http : //eccc.hpi-web.de/eccc-reports/2006/TR06-127/index.html [ hpi-web.de ] uses large Mersenne primes to get interesting results on Locally Decodable Codes and Private Information Retrieval Schemes.. .</tokentext>
<sentencetext>Actually, you can apparently use larger Mersenne Primes to improve results in totally different but very useful fields, like privacy-related schemes.
For example, this paper http://eccc.hpi-web.de/eccc-reports/2006/TR06-127/index.html [hpi-web.de] uses large Mersenne primes to get interesting results on Locally Decodable Codes and Private Information Retrieval Schemes...</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323335</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28340741</id>
	<title>Obligatory Joke</title>
	<author>Anonymous</author>
	<datestamp>1245060420000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>So a couple decided to name their child "Odd". During his entire childhood, and sometimes during his adult life, Odd wad ostracized and bullied for his weird name.</p><p>Odd quickly grew to hate his name. When he wrote his will, he asked that nothing be written upon his tombstone, so that he would not, even in death, be remembered by that loathed name of "Odd".</p><p>Odd grew old and died. His children followed his wishes and placed a blank stone slab above his grave.</p><p>To this day, when people walked past his grave and its blank tombstone, they would remark, "Huh? That's odd."</p></htmltext>
<tokenext>So a couple decided to name their child " Odd " .
During his entire childhood , and sometimes during his adult life , Odd wad ostracized and bullied for his weird name.Odd quickly grew to hate his name .
When he wrote his will , he asked that nothing be written upon his tombstone , so that he would not , even in death , be remembered by that loathed name of " Odd " .Odd grew old and died .
His children followed his wishes and placed a blank stone slab above his grave.To this day , when people walked past his grave and its blank tombstone , they would remark , " Huh ?
That 's odd .
"</tokentext>
<sentencetext>So a couple decided to name their child "Odd".
During his entire childhood, and sometimes during his adult life, Odd wad ostracized and bullied for his weird name.Odd quickly grew to hate his name.
When he wrote his will, he asked that nothing be written upon his tombstone, so that he would not, even in death, be remembered by that loathed name of "Odd".Odd grew old and died.
His children followed his wishes and placed a blank stone slab above his grave.To this day, when people walked past his grave and its blank tombstone, they would remark, "Huh?
That's odd.
"</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323257</id>
	<title>Re:Odd's prime</title>
	<author>Melkman</author>
	<datestamp>1244895840000</datestamp>
	<modclass>Funny</modclass>
	<modscore>2</modscore>
	<htmltext>That's odd when you think about it.</htmltext>
<tokenext>That 's odd when you think about it .</tokentext>
<sentencetext>That's odd when you think about it.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323155</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28325435</id>
	<title>Re:Cool processor - No, they can't</title>
	<author>TapeCutter</author>
	<datestamp>1244974920000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><i>"they could test 8 numbers at once, but they cannot test one number 8 times as fast."</i>
<br> <br>
Just because most searches use one number per core does not mean testing a single candidate can't be done very efficiently over multiple cores. You only have to think about the process for finding a prime, ie: testing factors, test if the candidate is it divisable by two, three, five, ect. <b>The test for each factor is independent</b>, so you COULD test 8 factors simultaneously, no?
<br> <br>
The only communication between threads is a semaphore to say "stop, thread XYZ found an integer factor", if you want to be pedantic it's not 8X as fast but rather <i>close to</i> 8X as fast. I suggest the reason most implementations use one candidate per core is because most searches look at more than one candidate and the semaphore test makes the alternative implementation <i>slightly</i> less efficent.</htmltext>
<tokenext>" they could test 8 numbers at once , but they can not test one number 8 times as fast .
" Just because most searches use one number per core does not mean testing a single candidate ca n't be done very efficiently over multiple cores .
You only have to think about the process for finding a prime , ie : testing factors , test if the candidate is it divisable by two , three , five , ect .
The test for each factor is independent , so you COULD test 8 factors simultaneously , no ?
The only communication between threads is a semaphore to say " stop , thread XYZ found an integer factor " , if you want to be pedantic it 's not 8X as fast but rather close to 8X as fast .
I suggest the reason most implementations use one candidate per core is because most searches look at more than one candidate and the semaphore test makes the alternative implementation slightly less efficent .</tokentext>
<sentencetext>"they could test 8 numbers at once, but they cannot test one number 8 times as fast.
"
 
Just because most searches use one number per core does not mean testing a single candidate can't be done very efficiently over multiple cores.
You only have to think about the process for finding a prime, ie: testing factors, test if the candidate is it divisable by two, three, five, ect.
The test for each factor is independent, so you COULD test 8 factors simultaneously, no?
The only communication between threads is a semaphore to say "stop, thread XYZ found an integer factor", if you want to be pedantic it's not 8X as fast but rather close to 8X as fast.
I suggest the reason most implementations use one candidate per core is because most searches look at more than one candidate and the semaphore test makes the alternative implementation slightly less efficent.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323725</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28325051</id>
	<title>According to The Guide ...</title>
	<author>fahrbot-bot</author>
	<datestamp>1244922600000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>According to the The Hitchhiker's Guide to the Galaxy, "Odd Magnar Strindmo" was a fourth generation accounting prefect on the third major planet of the second solar system in the first minor galactic cluster directly to the "left" of the vicinity of Betelgeuse - a star that has recently gone supernova.  After achieving a modicum of fame for discovering the 47th known Mersenne Prime, during extended holiday on the, mostly harmless, planet named Earth, Mr Strindmo retired to a life of semi-luxury where he preferred to be called "Steve".</htmltext>
<tokenext>According to the The Hitchhiker 's Guide to the Galaxy , " Odd Magnar Strindmo " was a fourth generation accounting prefect on the third major planet of the second solar system in the first minor galactic cluster directly to the " left " of the vicinity of Betelgeuse - a star that has recently gone supernova .
After achieving a modicum of fame for discovering the 47th known Mersenne Prime , during extended holiday on the , mostly harmless , planet named Earth , Mr Strindmo retired to a life of semi-luxury where he preferred to be called " Steve " .</tokentext>
<sentencetext>According to the The Hitchhiker's Guide to the Galaxy, "Odd Magnar Strindmo" was a fourth generation accounting prefect on the third major planet of the second solar system in the first minor galactic cluster directly to the "left" of the vicinity of Betelgeuse - a star that has recently gone supernova.
After achieving a modicum of fame for discovering the 47th known Mersenne Prime, during extended holiday on the, mostly harmless, planet named Earth, Mr Strindmo retired to a life of semi-luxury where he preferred to be called "Steve".</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323279</id>
	<title>wikipedia article</title>
	<author>Anonymous</author>
	<datestamp>1244896080000</datestamp>
	<modclass>Redundant</modclass>
	<modscore>-1</modscore>
	<htmltext><p>The obligatory wikipedia entry on <a href="http://en.wikipedia.org/wiki/Mersenne\_prime" title="wikipedia.org" rel="nofollow">mersenne primes</a> [wikipedia.org]. Come on, mods. Do your work properly.</p></htmltext>
<tokenext>The obligatory wikipedia entry on mersenne primes [ wikipedia.org ] .
Come on , mods .
Do your work properly .</tokentext>
<sentencetext>The obligatory wikipedia entry on mersenne primes [wikipedia.org].
Come on, mods.
Do your work properly.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323455</id>
	<title>Can we have the value?</title>
	<author>selven</author>
	<datestamp>1244897940000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>My calculator doesn't show it, anyone have the value of the prime?</htmltext>
<tokenext>My calculator does n't show it , anyone have the value of the prime ?</tokentext>
<sentencetext>My calculator doesn't show it, anyone have the value of the prime?</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323255</id>
	<title>The joys of untested code</title>
	<author>tqft</author>
	<datestamp>1244895840000</datestamp>
	<modclass>Interestin</modclass>
	<modscore>5</modscore>
	<htmltext><p>The admins missed the prime for about a month<br><a href="http://mersenneforum.org/showthread.php?t=11996" title="mersenneforum.org" rel="nofollow">http://mersenneforum.org/showthread.php?t=11996</a> [mersenneforum.org]<br>Apparently the email that was supposed to be sent wasn't when the prime was reported</p></htmltext>
<tokenext>The admins missed the prime for about a monthhttp : //mersenneforum.org/showthread.php ? t = 11996 [ mersenneforum.org ] Apparently the email that was supposed to be sent was n't when the prime was reported</tokentext>
<sentencetext>The admins missed the prime for about a monthhttp://mersenneforum.org/showthread.php?t=11996 [mersenneforum.org]Apparently the email that was supposed to be sent wasn't when the prime was reported</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323599</id>
	<title>Re:Can we have the value?</title>
	<author>Eudial</author>
	<datestamp>1244899320000</datestamp>
	<modclass>Funny</modclass>
	<modscore>3</modscore>
	<htmltext><p>In base 2, it's 1111[42,643,792 more 1:s]1111.<br>In base 16 it's 0xffff[2,665,229 more f:s]ffff.</p></htmltext>
<tokenext>In base 2 , it 's 1111 [ 42,643,792 more 1 : s ] 1111.In base 16 it 's 0xffff [ 2,665,229 more f : s ] ffff .</tokentext>
<sentencetext>In base 2, it's 1111[42,643,792 more 1:s]1111.In base 16 it's 0xffff[2,665,229 more f:s]ffff.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323455</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323491</id>
	<title>Wolfram says so in 1 sec.</title>
	<author>Anonymous</author>
	<datestamp>1244898180000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>Well I don't know why it took 29 days for the computer to tell him it was so, wolfram alpha told me it was <a href="http://www29.wolframalpha.com/input/?i=is+(2\%5E42\%2C643\%2C801+-+1)+a+prime+number" title="wolframalpha.com">prime in ~1 second.</a> [wolframalpha.com] </p><p>On that note, I asked Wolfram the other day the tree in a forest thing and I <a href="http://www29.wolframalpha.com/input/?i=if+a+tree+falls+in+the+forest+and+nobody+is+there+to+hear\%2C+does+it+make+a+sound" title="wolframalpha.com">finally have an answer!</a> [wolframalpha.com] </p></htmltext>
<tokenext>Well I do n't know why it took 29 days for the computer to tell him it was so , wolfram alpha told me it was prime in ~ 1 second .
[ wolframalpha.com ] On that note , I asked Wolfram the other day the tree in a forest thing and I finally have an answer !
[ wolframalpha.com ]</tokentext>
<sentencetext>Well I don't know why it took 29 days for the computer to tell him it was so, wolfram alpha told me it was prime in ~1 second.
[wolframalpha.com] On that note, I asked Wolfram the other day the tree in a forest thing and I finally have an answer!
[wolframalpha.com] </sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323229</id>
	<title>Re:Cool processor</title>
	<author>Nutria</author>
	<datestamp>1244895540000</datestamp>
	<modclass>Interestin</modclass>
	<modscore>3</modscore>
	<htmltext><p><i>Do they realize that they can put eight quad-core xeons in a machine and finish the calculation in a single shift instead of waiting a month?</i></p><p>What makes you think they aren't?</p><p>And what makes you think this man would pony up the serious coin for such a beast just to find a prime number?</p></htmltext>
<tokenext>Do they realize that they can put eight quad-core xeons in a machine and finish the calculation in a single shift instead of waiting a month ? What makes you think they are n't ? And what makes you think this man would pony up the serious coin for such a beast just to find a prime number ?</tokentext>
<sentencetext>Do they realize that they can put eight quad-core xeons in a machine and finish the calculation in a single shift instead of waiting a month?What makes you think they aren't?And what makes you think this man would pony up the serious coin for such a beast just to find a prime number?</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323137</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323675</id>
	<title>Re:Wolfram says so in 1 sec.</title>
	<author>chill</author>
	<datestamp>1244900160000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>Really?  I don't see where it generates output.</p><p>Change the last digit of the power to a 0 and it quickly comes up with FALSE, but I never see a "TRUE" for the original question.  Where is the answer?</p></htmltext>
<tokenext>Really ?
I do n't see where it generates output.Change the last digit of the power to a 0 and it quickly comes up with FALSE , but I never see a " TRUE " for the original question .
Where is the answer ?</tokentext>
<sentencetext>Really?
I don't see where it generates output.Change the last digit of the power to a 0 and it quickly comes up with FALSE, but I never see a "TRUE" for the original question.
Where is the answer?</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323491</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323453</id>
	<title>Re:Cool processor</title>
	<author>rbarreira</author>
	<datestamp>1244897880000</datestamp>
	<modclass>Insightful</modclass>
	<modscore>3</modscore>
	<htmltext><blockquote><div><p>Do they realize that they can put eight quad-core xeons in a machine and finish the calculation in a single shift instead of waiting a month?</p></div></blockquote><p>Do you realize that that's less efficient than using those 32 cores to calculate 32 independent numbers?</p></div>
	</htmltext>
<tokenext>Do they realize that they can put eight quad-core xeons in a machine and finish the calculation in a single shift instead of waiting a month ? Do you realize that that 's less efficient than using those 32 cores to calculate 32 independent numbers ?</tokentext>
<sentencetext>Do they realize that they can put eight quad-core xeons in a machine and finish the calculation in a single shift instead of waiting a month?Do you realize that that's less efficient than using those 32 cores to calculate 32 independent numbers?
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323137</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28324461</id>
	<title>Re:Cool processor</title>
	<author>Daswolfen</author>
	<datestamp>1244911920000</datestamp>
	<modclass>Informativ</modclass>
	<modscore>3</modscore>
	<htmltext><p>As one of the IT guys who maintain the lab that found the 43rd and 44th primes at University of Central Missouri (formerly CMSU), I can tell you its one number per core. Also, these are production machines in computer labs as well as classroom, faculty and staff systems that run the GIMPS software.</p><p>We are a public university, its not like we have extra $5k machines just sitting around crunching a number. BTW, the systems that found the 43rd and 44th prime numbers were base model Dell GX280s.</p></htmltext>
<tokenext>As one of the IT guys who maintain the lab that found the 43rd and 44th primes at University of Central Missouri ( formerly CMSU ) , I can tell you its one number per core .
Also , these are production machines in computer labs as well as classroom , faculty and staff systems that run the GIMPS software.We are a public university , its not like we have extra $ 5k machines just sitting around crunching a number .
BTW , the systems that found the 43rd and 44th prime numbers were base model Dell GX280s .</tokentext>
<sentencetext>As one of the IT guys who maintain the lab that found the 43rd and 44th primes at University of Central Missouri (formerly CMSU), I can tell you its one number per core.
Also, these are production machines in computer labs as well as classroom, faculty and staff systems that run the GIMPS software.We are a public university, its not like we have extra $5k machines just sitting around crunching a number.
BTW, the systems that found the 43rd and 44th prime numbers were base model Dell GX280s.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323137</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28327353</id>
	<title>Re:Wolfram says so in 1 sec.</title>
	<author>Anonymous</author>
	<datestamp>1245002940000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>Wolfram Alpha could not evaluate your question, so it only displays its interpretation of your input, which is the logical assertion that 2^blabla -1 is an element of the prime numbers. It does not evaluate this proposition to an output of TRUE or FALSE (although it can with several other changes, so I assume it has some quick algorithms to check with, but nothing processor intensive). For example, change the last two digits of the power to 71, and Wolfram|Alpha again cannot spit out TRUE or FALSE. I presume that I have not just discovered another Mersenne Prime so close to this new one.</p></htmltext>
<tokenext>Wolfram Alpha could not evaluate your question , so it only displays its interpretation of your input , which is the logical assertion that 2 ^ blabla -1 is an element of the prime numbers .
It does not evaluate this proposition to an output of TRUE or FALSE ( although it can with several other changes , so I assume it has some quick algorithms to check with , but nothing processor intensive ) .
For example , change the last two digits of the power to 71 , and Wolfram | Alpha again can not spit out TRUE or FALSE .
I presume that I have not just discovered another Mersenne Prime so close to this new one .</tokentext>
<sentencetext>Wolfram Alpha could not evaluate your question, so it only displays its interpretation of your input, which is the logical assertion that 2^blabla -1 is an element of the prime numbers.
It does not evaluate this proposition to an output of TRUE or FALSE (although it can with several other changes, so I assume it has some quick algorithms to check with, but nothing processor intensive).
For example, change the last two digits of the power to 71, and Wolfram|Alpha again cannot spit out TRUE or FALSE.
I presume that I have not just discovered another Mersenne Prime so close to this new one.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323491</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28326177</id>
	<title>It was done with GIMPS</title>
	<author>selven</author>
	<datestamp>1244990340000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>I say the entire number was photoshopped.</htmltext>
<tokenext>I say the entire number was photoshopped .</tokentext>
<sentencetext>I say the entire number was photoshopped.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323863</id>
	<title>Re:Wolfram says so in 1 sec.</title>
	<author>Anonymous</author>
	<datestamp>1244902680000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>It does *not* say so. It just reformats youir question mathematically. That's the INPUT you see. There is no output. Observe that if you type in another number (e.g. replace the -1 by 0 or by -3), then it will have an OUTPUT section as well.</p></htmltext>
<tokenext>It does * not * say so .
It just reformats youir question mathematically .
That 's the INPUT you see .
There is no output .
Observe that if you type in another number ( e.g .
replace the -1 by 0 or by -3 ) , then it will have an OUTPUT section as well .</tokentext>
<sentencetext>It does *not* say so.
It just reformats youir question mathematically.
That's the INPUT you see.
There is no output.
Observe that if you type in another number (e.g.
replace the -1 by 0 or by -3), then it will have an OUTPUT section as well.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323491</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323909</id>
	<title>And when they find the 50th...</title>
	<author>Anonymous</author>
	<datestamp>1244903220000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>... the Great Old Ones will return, all life on earth will be destroyed.</htmltext>
<tokenext>... the Great Old Ones will return , all life on earth will be destroyed .</tokentext>
<sentencetext>... the Great Old Ones will return, all life on earth will be destroyed.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323231</id>
	<title>Re:Cool processor</title>
	<author>JoshuaZ</author>
	<datestamp>1244895540000</datestamp>
	<modclass>Informativ</modclass>
	<modscore>5</modscore>
	<htmltext><p>
The system used for this is GIMPS, the Great Internet Mersenne Prime Search. The system uses a distributed computing system using unused computing power in personal computers to search for various candidate primes. Computers do one of two things: Either trying to factor candidate Mersenne numbers or running a Lucas-Lehmer test on candidates without any small prime factors (the Lucas-Lehmer test is a special primality test for Mersenne numbers that is very fast). They use modular arithmetic and a variant of the Fast Fourier Transform to handle the multiplications which might otherwise become too difficult. The procedure is naturally a problem that can be made into a parallel processing problem like this since there are so many different candidate numbers to look at.
</p><p>
The summary doesn't mention but it is worth noting that the Lucas-Lehmer test allows one to check the primality of Mersenne numbers (numbers of the form 2^p-1, p prime) much faster than you can test the primality of generic numbers (or almost any other specialized form). Thus, for most of the last hundred years the largest primes known have been Mersenne primes. Currently the largest known prime is a Mersenne prime and the next 4 largest are also Mersenne primes. The GIMPS website - <a href="http://mersenne.org/" title="mersenne.org">http://mersenne.org/</a> [mersenne.org] has a lot more details of both the math and software and explains how you can join in to help the project.</p></htmltext>
<tokenext>The system used for this is GIMPS , the Great Internet Mersenne Prime Search .
The system uses a distributed computing system using unused computing power in personal computers to search for various candidate primes .
Computers do one of two things : Either trying to factor candidate Mersenne numbers or running a Lucas-Lehmer test on candidates without any small prime factors ( the Lucas-Lehmer test is a special primality test for Mersenne numbers that is very fast ) .
They use modular arithmetic and a variant of the Fast Fourier Transform to handle the multiplications which might otherwise become too difficult .
The procedure is naturally a problem that can be made into a parallel processing problem like this since there are so many different candidate numbers to look at .
The summary does n't mention but it is worth noting that the Lucas-Lehmer test allows one to check the primality of Mersenne numbers ( numbers of the form 2 ^ p-1 , p prime ) much faster than you can test the primality of generic numbers ( or almost any other specialized form ) .
Thus , for most of the last hundred years the largest primes known have been Mersenne primes .
Currently the largest known prime is a Mersenne prime and the next 4 largest are also Mersenne primes .
The GIMPS website - http : //mersenne.org/ [ mersenne.org ] has a lot more details of both the math and software and explains how you can join in to help the project .</tokentext>
<sentencetext>
The system used for this is GIMPS, the Great Internet Mersenne Prime Search.
The system uses a distributed computing system using unused computing power in personal computers to search for various candidate primes.
Computers do one of two things: Either trying to factor candidate Mersenne numbers or running a Lucas-Lehmer test on candidates without any small prime factors (the Lucas-Lehmer test is a special primality test for Mersenne numbers that is very fast).
They use modular arithmetic and a variant of the Fast Fourier Transform to handle the multiplications which might otherwise become too difficult.
The procedure is naturally a problem that can be made into a parallel processing problem like this since there are so many different candidate numbers to look at.
The summary doesn't mention but it is worth noting that the Lucas-Lehmer test allows one to check the primality of Mersenne numbers (numbers of the form 2^p-1, p prime) much faster than you can test the primality of generic numbers (or almost any other specialized form).
Thus, for most of the last hundred years the largest primes known have been Mersenne primes.
Currently the largest known prime is a Mersenne prime and the next 4 largest are also Mersenne primes.
The GIMPS website - http://mersenne.org/ [mersenne.org] has a lot more details of both the math and software and explains how you can join in to help the project.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323137</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323181</id>
	<title>pix plz</title>
	<author>cupantae</author>
	<datestamp>1244895060000</datestamp>
	<modclass>Offtopic</modclass>
	<modscore>-1</modscore>
	<htmltext><p>pix plz</p></htmltext>
<tokenext>pix plz</tokentext>
<sentencetext>pix plz</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323161</id>
	<title>Re:Cool processor</title>
	<author>Anonymous</author>
	<datestamp>1244894880000</datestamp>
	<modclass>Informativ</modclass>
	<modscore>4</modscore>
	<htmltext><p><div class="quote"><p>They're crunching 13-million-digit numbers with a desktop processor? Do they realize that they can put eight quad-core xeons in a machine and finish the calculation in a single shift instead of waiting a month?</p></div><p>I don't know about you, but the last 13 or so mersenne primes have been found using prime95 as a conduit for a mass distributed effort. I'm not sure where you live, but in most other places people can't just go out and put 8 quad-core xeons in a home machine.</p></div>
	</htmltext>
<tokenext>They 're crunching 13-million-digit numbers with a desktop processor ?
Do they realize that they can put eight quad-core xeons in a machine and finish the calculation in a single shift instead of waiting a month ? I do n't know about you , but the last 13 or so mersenne primes have been found using prime95 as a conduit for a mass distributed effort .
I 'm not sure where you live , but in most other places people ca n't just go out and put 8 quad-core xeons in a home machine .</tokentext>
<sentencetext>They're crunching 13-million-digit numbers with a desktop processor?
Do they realize that they can put eight quad-core xeons in a machine and finish the calculation in a single shift instead of waiting a month?I don't know about you, but the last 13 or so mersenne primes have been found using prime95 as a conduit for a mass distributed effort.
I'm not sure where you live, but in most other places people can't just go out and put 8 quad-core xeons in a home machine.
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323137</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323137</id>
	<title>Cool processor</title>
	<author>Anonymous</author>
	<datestamp>1244894520000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext>They're crunching 13-million-digit numbers with a desktop processor? Do they realize that they can put eight quad-core xeons in a machine and finish the calculation in a single shift instead of waiting a month?</htmltext>
<tokenext>They 're crunching 13-million-digit numbers with a desktop processor ?
Do they realize that they can put eight quad-core xeons in a machine and finish the calculation in a single shift instead of waiting a month ?</tokentext>
<sentencetext>They're crunching 13-million-digit numbers with a desktop processor?
Do they realize that they can put eight quad-core xeons in a machine and finish the calculation in a single shift instead of waiting a month?</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323313</id>
	<title>"telescope" from Intel</title>
	<author>moon3</author>
	<datestamp>1244896380000</datestamp>
	<modclass>Interestin</modclass>
	<modscore>2</modscore>
	<htmltext>Discovering a prime number that distant from the zero is like discovering a Pluto like planet in  outer space. But instead of Hubble telescope you need a powerful mathematical one..</htmltext>
<tokenext>Discovering a prime number that distant from the zero is like discovering a Pluto like planet in outer space .
But instead of Hubble telescope you need a powerful mathematical one. .</tokentext>
<sentencetext>Discovering a prime number that distant from the zero is like discovering a Pluto like planet in  outer space.
But instead of Hubble telescope you need a powerful mathematical one..</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28326019</id>
	<title>Re:Cool processor - No, they can't</title>
	<author>rbarreira</author>
	<datestamp>1244988180000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>The primality test for these Mersenne primes does not consist of sieving, that would be way too slow given the size of these numbers.</p><p>Instead, the Lucas-Lehmer test is used, a very simple iterative process which you can implement in a few lines of code in most programming languages. It's described here:</p><p><a href="http://primes.utm.edu/mersenne/index.html#test" title="utm.edu">http://primes.utm.edu/mersenne/index.html#test</a> [utm.edu]</p></htmltext>
<tokenext>The primality test for these Mersenne primes does not consist of sieving , that would be way too slow given the size of these numbers.Instead , the Lucas-Lehmer test is used , a very simple iterative process which you can implement in a few lines of code in most programming languages .
It 's described here : http : //primes.utm.edu/mersenne/index.html # test [ utm.edu ]</tokentext>
<sentencetext>The primality test for these Mersenne primes does not consist of sieving, that would be way too slow given the size of these numbers.Instead, the Lucas-Lehmer test is used, a very simple iterative process which you can implement in a few lines of code in most programming languages.
It's described here:http://primes.utm.edu/mersenne/index.html#test [utm.edu]</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28325435</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323725</id>
	<title>Re:Cool processor - No, they can't</title>
	<author>davmoo</author>
	<datestamp>1244900820000</datestamp>
	<modclass>Informativ</modclass>
	<modscore>3</modscore>
	<htmltext><p><i>Do they realize that they can put eight quad-core xeons in a machine and finish the calculation in a single shift instead of waiting a month?</i></p><p>No, they can't.  Each iteration of the software requires the results of the previous iteration.  It cannot easily be made to run like you want on multiple cores.  The best they could do on the processor you describe is run 8 separate copies of the application, each taking one month to run...they could test 8 numbers at once, but they cannot test one number 8 times as fast.</p></htmltext>
<tokenext>Do they realize that they can put eight quad-core xeons in a machine and finish the calculation in a single shift instead of waiting a month ? No , they ca n't .
Each iteration of the software requires the results of the previous iteration .
It can not easily be made to run like you want on multiple cores .
The best they could do on the processor you describe is run 8 separate copies of the application , each taking one month to run...they could test 8 numbers at once , but they can not test one number 8 times as fast .</tokentext>
<sentencetext>Do they realize that they can put eight quad-core xeons in a machine and finish the calculation in a single shift instead of waiting a month?No, they can't.
Each iteration of the software requires the results of the previous iteration.
It cannot easily be made to run like you want on multiple cores.
The best they could do on the processor you describe is run 8 separate copies of the application, each taking one month to run...they could test 8 numbers at once, but they cannot test one number 8 times as fast.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323137</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323741</id>
	<title>Re:Cool processor - No, they can't - correction</title>
	<author>davmoo</author>
	<datestamp>1244901060000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>My bad...I misread your processor description...I thought you said 8-core.  My answer is still correct though, I just used the wrong number of copies.  They can run one copy per core, and the copies cannot exchange information.</p></htmltext>
<tokenext>My bad...I misread your processor description...I thought you said 8-core .
My answer is still correct though , I just used the wrong number of copies .
They can run one copy per core , and the copies can not exchange information .</tokentext>
<sentencetext>My bad...I misread your processor description...I thought you said 8-core.
My answer is still correct though, I just used the wrong number of copies.
They can run one copy per core, and the copies cannot exchange information.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323137</parent>
</comment>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_06_13_2218226_1</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28327353
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323491
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_06_13_2218226_8</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323741
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323137
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_06_13_2218226_12</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28326019
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28325435
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323725
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323137
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_06_13_2218226_5</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323599
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323455
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_06_13_2218226_2</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323161
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323137
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_06_13_2218226_6</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323453
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323137
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_06_13_2218226_3</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28324461
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323137
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_06_13_2218226_9</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28325795
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323335
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_06_13_2218226_7</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323229
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323137
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_06_13_2218226_13</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323863
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323491
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_06_13_2218226_10</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323231
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323137
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_06_13_2218226_0</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323257
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323155
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_06_13_2218226_11</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323575
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323155
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_09_06_13_2218226_4</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323675
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323491
</commentlist>
</thread>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation09_06_13_2218226.2</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323155
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323575
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323257
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation09_06_13_2218226.0</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323909
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation09_06_13_2218226.3</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323255
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation09_06_13_2218226.6</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323455
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323599
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation09_06_13_2218226.1</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323137
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323725
--http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28325435
---http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28326019
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323161
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323453
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323741
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28324461
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323229
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323231
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation09_06_13_2218226.4</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323335
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28325795
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation09_06_13_2218226.5</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323491
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323863
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28327353
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment09_06_13_2218226.28323675
</commentlist>
</conversation>
