<article>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#article10_03_26_1645218</id>
	<title>Home-Built Turing Machine</title>
	<author>Soulskill</author>
	<datestamp>1269624660000</datestamp>
	<htmltext>stronghawk writes <i>"The creator of the <a href="http://www.parallax.com/tabid/769/Default.aspx">Nickel-O-Matic</a> is back at it and has now <a href="http://aturingmachine.com/">built a Turing Machine</a> from a Parallax Propeller chip-based controller, motors, a dry-erase marker and a non-infinite supply of shiny 35mm leader film. From his FAQ: 'While thinking about Turing machines I found that no one had ever actually built one, at least not one that looked like Turing's original concept (if someone does know of one, please let me know). There have been a few other physical Turing machines like the Logo of Doom, but none were immediately recognizable as Turing machines. As I am always looking for a new challenge, I set out to build what you see here.'"</i></htmltext>
<tokenext>stronghawk writes " The creator of the Nickel-O-Matic is back at it and has now built a Turing Machine from a Parallax Propeller chip-based controller , motors , a dry-erase marker and a non-infinite supply of shiny 35mm leader film .
From his FAQ : 'While thinking about Turing machines I found that no one had ever actually built one , at least not one that looked like Turing 's original concept ( if someone does know of one , please let me know ) .
There have been a few other physical Turing machines like the Logo of Doom , but none were immediately recognizable as Turing machines .
As I am always looking for a new challenge , I set out to build what you see here .
' "</tokentext>
<sentencetext>stronghawk writes "The creator of the Nickel-O-Matic is back at it and has now built a Turing Machine from a Parallax Propeller chip-based controller, motors, a dry-erase marker and a non-infinite supply of shiny 35mm leader film.
From his FAQ: 'While thinking about Turing machines I found that no one had ever actually built one, at least not one that looked like Turing's original concept (if someone does know of one, please let me know).
There have been a few other physical Turing machines like the Logo of Doom, but none were immediately recognizable as Turing machines.
As I am always looking for a new challenge, I set out to build what you see here.
'"</sentencetext>
</article>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630722</id>
	<title>Re:Technically...</title>
	<author>Eowaennor</author>
	<datestamp>1269634140000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>Was anyone else reminded of this quote?
"If, he thought to himself, such amachine is a virtual impossibility, then it must logically be a finite improbability. So all I have to do in order to make one, is to work out exactly how improbable it is, feed that figure into the finite improbability generator, give it a fresh cup of really hot tea<nobr> <wbr></nobr>... and turn it on!"</div>
	</htmltext>
<tokenext>Was anyone else reminded of this quote ?
" If , he thought to himself , such amachine is a virtual impossibility , then it must logically be a finite improbability .
So all I have to do in order to make one , is to work out exactly how improbable it is , feed that figure into the finite improbability generator , give it a fresh cup of really hot tea ... and turn it on !
"</tokentext>
<sentencetext>Was anyone else reminded of this quote?
"If, he thought to himself, such amachine is a virtual impossibility, then it must logically be a finite improbability.
So all I have to do in order to make one, is to work out exactly how improbable it is, feed that figure into the finite improbability generator, give it a fresh cup of really hot tea ... and turn it on!
"
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629394</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629808</id>
	<title>bad moderation</title>
	<author>Khashishi</author>
	<datestamp>1269630540000</datestamp>
	<modclass>Insightful</modclass>
	<modscore>2</modscore>
	<htmltext><p>It looks like some berserk moderators got in here. Why all the troll mods?</p></htmltext>
<tokenext>It looks like some berserk moderators got in here .
Why all the troll mods ?</tokentext>
<sentencetext>It looks like some berserk moderators got in here.
Why all the troll mods?</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629550</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629358</id>
	<title>This made me have a major geek moment.</title>
	<author>BlueKitties</author>
	<datestamp>1269629160000</datestamp>
	<modclass>Funny</modclass>
	<modscore>4</modscore>
	<htmltext>For social reasons I will refrain from mentioning this to my friends (which I have) later tonight. Baaaah, I want one! This is so pointless but nifty, my inner collector is crying out. Damn fiscal responsibilities in life tell me it's a waste of money, but oh, the geeky child inside cries out!</htmltext>
<tokenext>For social reasons I will refrain from mentioning this to my friends ( which I have ) later tonight .
Baaaah , I want one !
This is so pointless but nifty , my inner collector is crying out .
Damn fiscal responsibilities in life tell me it 's a waste of money , but oh , the geeky child inside cries out !</tokentext>
<sentencetext>For social reasons I will refrain from mentioning this to my friends (which I have) later tonight.
Baaaah, I want one!
This is so pointless but nifty, my inner collector is crying out.
Damn fiscal responsibilities in life tell me it's a waste of money, but oh, the geeky child inside cries out!</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629392</id>
	<title>I found that no one had ever actually built one</title>
	<author>Anonymous</author>
	<datestamp>1269629280000</datestamp>
	<modclass>Interestin</modclass>
	<modscore>1</modscore>
	<htmltext><p>I think you'll find that every single computer ever made has been a Turing machine.</p></htmltext>
<tokenext>I think you 'll find that every single computer ever made has been a Turing machine .</tokentext>
<sentencetext>I think you'll find that every single computer ever made has been a Turing machine.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629722</id>
	<title>How cute.</title>
	<author>Beelzebud</author>
	<datestamp>1269630300000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>A troll with mod points...
<br>
<br>
As for the article though, this is really cool stuff.   This machine would have fit right in on the set of Terry Gilliam's Brazil.</htmltext>
<tokenext>A troll with mod points.. . As for the article though , this is really cool stuff .
This machine would have fit right in on the set of Terry Gilliam 's Brazil .</tokentext>
<sentencetext>A troll with mod points...


As for the article though, this is really cool stuff.
This machine would have fit right in on the set of Terry Gilliam's Brazil.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630538</id>
	<title>Re:You're Doing It Wrong</title>
	<author>sachamm</author>
	<datestamp>1269633360000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>The duality between data and program is one of the fundamental concepts of computer science.

The Turing machine is a program that runs another program. The outer program encodes the (simple, encodable) rules of the Turing machine, and was originally intended to be a human with unlimited paper and pencil. The inner program is the tape.

Ask yourself this: what would this machine do without a tape?</htmltext>
<tokenext>The duality between data and program is one of the fundamental concepts of computer science .
The Turing machine is a program that runs another program .
The outer program encodes the ( simple , encodable ) rules of the Turing machine , and was originally intended to be a human with unlimited paper and pencil .
The inner program is the tape .
Ask yourself this : what would this machine do without a tape ?</tokentext>
<sentencetext>The duality between data and program is one of the fundamental concepts of computer science.
The Turing machine is a program that runs another program.
The outer program encodes the (simple, encodable) rules of the Turing machine, and was originally intended to be a human with unlimited paper and pencil.
The inner program is the tape.
Ask yourself this: what would this machine do without a tape?</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629398</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630672</id>
	<title>Re:Setting aside the Turing stuff...</title>
	<author>Y Ddraig Goch</author>
	<datestamp>1269633960000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>+1</htmltext>
<tokenext>+ 1</tokentext>
<sentencetext>+1</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629810</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631634</id>
	<title>Re:hmmm</title>
	<author>shutdown -p now</author>
	<datestamp>1269594600000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>I'd imagine that, when you explain the concept of a Turing machine to someone, having a physical implementation like that, where all operations are explicit and obvious, might help.</p></htmltext>
<tokenext>I 'd imagine that , when you explain the concept of a Turing machine to someone , having a physical implementation like that , where all operations are explicit and obvious , might help .</tokentext>
<sentencetext>I'd imagine that, when you explain the concept of a Turing machine to someone, having a physical implementation like that, where all operations are explicit and obvious, might help.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629232</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630388</id>
	<title>Isn't this actually using three states?</title>
	<author>Anonymous</author>
	<datestamp>1269632760000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>Isn't this actually using three states?  1, 0, and blank tape?  It should put a 1 for 1 and leave a blank for 0...</p></htmltext>
<tokenext>Is n't this actually using three states ?
1 , 0 , and blank tape ?
It should put a 1 for 1 and leave a blank for 0.. .</tokentext>
<sentencetext>Isn't this actually using three states?
1, 0, and blank tape?
It should put a 1 for 1 and leave a blank for 0...</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630720</id>
	<title>Obligatory</title>
	<author>Jeremi</author>
	<datestamp>1269634140000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>Yeah, but does it run Linux?</p></htmltext>
<tokenext>Yeah , but does it run Linux ?</tokentext>
<sentencetext>Yeah, but does it run Linux?</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31633254</id>
	<title>Re:Setting aside the Turing stuff...</title>
	<author>Danny Rathjens</author>
	<datestamp>1269601440000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>The video was very well done, too.  I thought I was watching an episode of "How It's Made."  It almost made me want to turn off adblock to give him some revenue... almost.<nobr> <wbr></nobr>;)</htmltext>
<tokenext>The video was very well done , too .
I thought I was watching an episode of " How It 's Made .
" It almost made me want to turn off adblock to give him some revenue... almost. ; )</tokentext>
<sentencetext>The video was very well done, too.
I thought I was watching an episode of "How It's Made.
"  It almost made me want to turn off adblock to give him some revenue... almost. ;)</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629810</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630336</id>
	<title>Re:Technically...</title>
	<author>just\_another\_sean</author>
	<datestamp>1269632520000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>Bureaucrat Corporate\_Troll you are <b>technically</b> correct, the best kind of correct.</p></htmltext>
<tokenext>Bureaucrat Corporate \ _Troll you are technically correct , the best kind of correct .</tokentext>
<sentencetext>Bureaucrat Corporate\_Troll you are technically correct, the best kind of correct.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629394</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631158</id>
	<title>Re:Finite State Machine</title>
	<author>radtea</author>
	<datestamp>1269635880000</datestamp>
	<modclass>Funny</modclass>
	<modscore>3</modscore>
	<htmltext><p><div class="quote"><p>What I find tickling about this implementation is the clear evidence of an embedded FSM emulating the programmed TM.</p></div><p>The Flying Spaghetti Monster is embedded in the programmed Transcendental Meditation?</p><p>Proof of Intelligent Design!</p></div>
	</htmltext>
<tokenext>What I find tickling about this implementation is the clear evidence of an embedded FSM emulating the programmed TM.The Flying Spaghetti Monster is embedded in the programmed Transcendental Meditation ? Proof of Intelligent Design !</tokentext>
<sentencetext>What I find tickling about this implementation is the clear evidence of an embedded FSM emulating the programmed TM.The Flying Spaghetti Monster is embedded in the programmed Transcendental Meditation?Proof of Intelligent Design!
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630220</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631720</id>
	<title>Re:Isn't this actually using three states?</title>
	<author>chromas</author>
	<datestamp>1269594960000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>Blank tape is unformatted media. Please run <i>mkfs.tm</i> first.</htmltext>
<tokenext>Blank tape is unformatted media .
Please run mkfs.tm first .</tokentext>
<sentencetext>Blank tape is unformatted media.
Please run mkfs.tm first.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630388</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630292</id>
	<title>Re:Technically...</title>
	<author>eclectro</author>
	<datestamp>1269632400000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p><div class="quote"><p>Purely technically, a Turing Machine that hasn't infinite tapes is simply a Finite State Machine.</p> </div><p>Then by extension, you could not program one either. So essentially all those Turing machines programmed in computers really aren't. The fact is, from the busy beaver's point of view, the Turing machine is real as long as you don't run out of tape. It perhaps would help this Turing machine if the reels of tape were larger (so it would not run out of tape before it halted). Of course, the more complex Turing machines <i>will</i> run out of tape (or exceed the limits of the computer!).</p><p>I think the bigger flaw to this machine is that the machine is not made to look like a cute furry beaver.</p></div>
	</htmltext>
<tokenext>Purely technically , a Turing Machine that has n't infinite tapes is simply a Finite State Machine .
Then by extension , you could not program one either .
So essentially all those Turing machines programmed in computers really are n't .
The fact is , from the busy beaver 's point of view , the Turing machine is real as long as you do n't run out of tape .
It perhaps would help this Turing machine if the reels of tape were larger ( so it would not run out of tape before it halted ) .
Of course , the more complex Turing machines will run out of tape ( or exceed the limits of the computer !
) .I think the bigger flaw to this machine is that the machine is not made to look like a cute furry beaver .</tokentext>
<sentencetext>Purely technically, a Turing Machine that hasn't infinite tapes is simply a Finite State Machine.
Then by extension, you could not program one either.
So essentially all those Turing machines programmed in computers really aren't.
The fact is, from the busy beaver's point of view, the Turing machine is real as long as you don't run out of tape.
It perhaps would help this Turing machine if the reels of tape were larger (so it would not run out of tape before it halted).
Of course, the more complex Turing machines will run out of tape (or exceed the limits of the computer!
).I think the bigger flaw to this machine is that the machine is not made to look like a cute furry beaver.
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629394</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629206</id>
	<title>Cool...I think.</title>
	<author>Anonymous</author>
	<datestamp>1269628620000</datestamp>
	<modclass>Insightful</modclass>
	<modscore>2</modscore>
	<htmltext><p>I admire people who build things like this, but at the same time I also wonder just why the heck they do it.</p><p>I guess that's the difference between people, I'd rather build something new than re-create something that's been done before.  (Honestly not trying to sound like an ass, just find it interesting.)</p></htmltext>
<tokenext>I admire people who build things like this , but at the same time I also wonder just why the heck they do it.I guess that 's the difference between people , I 'd rather build something new than re-create something that 's been done before .
( Honestly not trying to sound like an ass , just find it interesting .
)</tokentext>
<sentencetext>I admire people who build things like this, but at the same time I also wonder just why the heck they do it.I guess that's the difference between people, I'd rather build something new than re-create something that's been done before.
(Honestly not trying to sound like an ass, just find it interesting.
)</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31644116</id>
	<title>His next project?</title>
	<author>Arterion</author>
	<datestamp>1269699540000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>Maybe he can put my friend's annoying cat in a box that's rigged up to release a hammer that will shattering a vial of acid if a radioactive isotope decays. Though in practice, nothing will change. It seems like it simultaneously may or may not claw me at any given point. I can't see how it simultaneously being dead or alive will be any more or less predictable than its own capricious nature, with respect to being clawed.</p></htmltext>
<tokenext>Maybe he can put my friend 's annoying cat in a box that 's rigged up to release a hammer that will shattering a vial of acid if a radioactive isotope decays .
Though in practice , nothing will change .
It seems like it simultaneously may or may not claw me at any given point .
I ca n't see how it simultaneously being dead or alive will be any more or less predictable than its own capricious nature , with respect to being clawed .</tokentext>
<sentencetext>Maybe he can put my friend's annoying cat in a box that's rigged up to release a hammer that will shattering a vial of acid if a radioactive isotope decays.
Though in practice, nothing will change.
It seems like it simultaneously may or may not claw me at any given point.
I can't see how it simultaneously being dead or alive will be any more or less predictable than its own capricious nature, with respect to being clawed.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629886</id>
	<title>New Math?</title>
	<author>Jason1729</author>
	<datestamp>1269630840000</datestamp>
	<modclass>Funny</modclass>
	<modscore>2</modscore>
	<htmltext>Wow...where can I buy a Turing-complete microcontroller?</htmltext>
<tokenext>Wow...where can I buy a Turing-complete microcontroller ?</tokentext>
<sentencetext>Wow...where can I buy a Turing-complete microcontroller?</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629398</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631566</id>
	<title>Re:Obligatory</title>
	<author>AP31R0N</author>
	<datestamp>1269594360000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>Yes, but only on a Beowulf cluster of them in Soviet Russia.  YMMV.</p></htmltext>
<tokenext>Yes , but only on a Beowulf cluster of them in Soviet Russia .
YMMV .</tokentext>
<sentencetext>Yes, but only on a Beowulf cluster of them in Soviet Russia.
YMMV.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630720</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631374</id>
	<title>Re:hmmm</title>
	<author>Anonymous</author>
	<datestamp>1269636780000</datestamp>
	<modclass>Informativ</modclass>
	<modscore>1</modscore>
	<htmltext><p>A "Turing machine" is what you see in the video&mdash;or at least it would be, if it were an ideal abstraction with an infinite supply of tape and the ability to remember an unlimited number of states (although the number of states would be finite in any given program). A "Turing-complete" machine/language is one that is capable of simulating a Turing machine&mdash;again, adjusting for finite memory within the bounds of common sense.</p><p>The significance is that Turing proved that a Turing machine can execute anything at all that we would intuitively call an "algorithm". So, if you have a new programming language, all you have to do is prove that it can simulate a Turing machine like the one in the video&mdash;a very easy task in most cases, doable even with a perversely simple language like Whitespace or Brainfuck&mdash;and bang, you've proven that you have a language capable of executing any algorithm at all, a "Turing-complete" language.</p></htmltext>
<tokenext>A " Turing machine " is what you see in the video    or at least it would be , if it were an ideal abstraction with an infinite supply of tape and the ability to remember an unlimited number of states ( although the number of states would be finite in any given program ) .
A " Turing-complete " machine/language is one that is capable of simulating a Turing machine    again , adjusting for finite memory within the bounds of common sense.The significance is that Turing proved that a Turing machine can execute anything at all that we would intuitively call an " algorithm " .
So , if you have a new programming language , all you have to do is prove that it can simulate a Turing machine like the one in the video    a very easy task in most cases , doable even with a perversely simple language like Whitespace or Brainfuck    and bang , you 've proven that you have a language capable of executing any algorithm at all , a " Turing-complete " language .</tokentext>
<sentencetext>A "Turing machine" is what you see in the video—or at least it would be, if it were an ideal abstraction with an infinite supply of tape and the ability to remember an unlimited number of states (although the number of states would be finite in any given program).
A "Turing-complete" machine/language is one that is capable of simulating a Turing machine—again, adjusting for finite memory within the bounds of common sense.The significance is that Turing proved that a Turing machine can execute anything at all that we would intuitively call an "algorithm".
So, if you have a new programming language, all you have to do is prove that it can simulate a Turing machine like the one in the video—a very easy task in most cases, doable even with a perversely simple language like Whitespace or Brainfuck—and bang, you've proven that you have a language capable of executing any algorithm at all, a "Turing-complete" language.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629232</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631440</id>
	<title>Re:Isn't this actually using three states?</title>
	<author>quadelirus</author>
	<datestamp>1269637080000</datestamp>
	<modclass>Insightful</modclass>
	<modscore>2</modscore>
	<htmltext>I believe the 1, 0 and blank are the characters of the TM's alphabet, not the states. The states are internal to the machine and there can be quite a lot of them depending on what the program is to accept the TM's language.</htmltext>
<tokenext>I believe the 1 , 0 and blank are the characters of the TM 's alphabet , not the states .
The states are internal to the machine and there can be quite a lot of them depending on what the program is to accept the TM 's language .</tokentext>
<sentencetext>I believe the 1, 0 and blank are the characters of the TM's alphabet, not the states.
The states are internal to the machine and there can be quite a lot of them depending on what the program is to accept the TM's language.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630388</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630072</id>
	<title>So what?</title>
	<author>Anonymous</author>
	<datestamp>1269631560000</datestamp>
	<modclass>Funny</modclass>
	<modscore>0</modscore>
	<htmltext><p>I'm using a Turing machine to make this post right now. What's the big deal?</p><p>Mine's faster, too.</p></htmltext>
<tokenext>I 'm using a Turing machine to make this post right now .
What 's the big deal ? Mine 's faster , too .</tokentext>
<sentencetext>I'm using a Turing machine to make this post right now.
What's the big deal?Mine's faster, too.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31633202</id>
	<title>Re:Setting aside the Turing stuff...</title>
	<author>Anonymous</author>
	<datestamp>1269601140000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>Not only is he a superb designer, he is a superb director. That video was beautifully made.</p></htmltext>
<tokenext>Not only is he a superb designer , he is a superb director .
That video was beautifully made .</tokentext>
<sentencetext>Not only is he a superb designer, he is a superb director.
That video was beautifully made.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629810</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631430</id>
	<title>Re:Setting aside the Turing stuff...</title>
	<author>I\_am\_the\_cheese</author>
	<datestamp>1269637020000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>What are the orders of geekhood and who ordains them? and which is the highest? Order of the Strong Pocket Protector? Order of Turing?</htmltext>
<tokenext>What are the orders of geekhood and who ordains them ?
and which is the highest ?
Order of the Strong Pocket Protector ?
Order of Turing ?</tokentext>
<sentencetext>What are the orders of geekhood and who ordains them?
and which is the highest?
Order of the Strong Pocket Protector?
Order of Turing?</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629810</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31643186</id>
	<title>Re:Setting aside the Turing stuff...</title>
	<author>FrankDrebin</author>
	<datestamp>1269688980000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>True dat.</htmltext>
<tokenext>True dat .</tokentext>
<sentencetext>True dat.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629810</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631682</id>
	<title>So you haven't seen this?</title>
	<author>Anonymous</author>
	<datestamp>1269594780000</datestamp>
	<modclass>Interestin</modclass>
	<modscore>2</modscore>
	<htmltext><p><a href="http://www.youtube.com/watch?v=cYw2ewoO6c4&amp;feature=fvst" title="youtube.com" rel="nofollow">http://www.youtube.com/watch?v=cYw2ewoO6c4&amp;feature=fvst</a> [youtube.com]</p></htmltext>
<tokenext>http : //www.youtube.com/watch ? v = cYw2ewoO6c4&amp;feature = fvst [ youtube.com ]</tokentext>
<sentencetext>http://www.youtube.com/watch?v=cYw2ewoO6c4&amp;feature=fvst [youtube.com]</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31633346</id>
	<title>Re:Finite State Machine</title>
	<author>epine</author>
	<datestamp>1269602040000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p><div class="quote"><p>Until he installs an infinite tape, this is computationally equivalent to a Finite Automata.</p></div><p>Welcome to theoretic physics.  Hope you enjoy your career computing landscape probabilities over the 10^500 purported vacuum states.  Bring lots of sharp pencils, you'll need them.</p><p>Experimentally, this machine is indistinguishable from a real Turing machine until it whumps up against the end of the tape and the tape daemon refuses to splice a continuation tape.  This is known as Fermat's procurement failure.</p><p>Then again, there is no such thing as an observable distinction of a real Turing machine from a fake one, since it takes an infinite amount of time to observe that the tape in infinite in length.</p><p>Even if the universe had formed with a doubly-infinite tape stretching across the cosmic vastness, cosmic expansion will eventually stretch your tape faster than you can read it.</p><p>It's an interesting physics problem what happens if you have an infinite string at constant tension (with a uniform mass of so many grams/meter) what happens when you severe it into a pair of singly-infinite tapes.  Hmmm, you probably have to work with tension in N/m^2 (cross section) and you still get problems with infinite acceleration at the end points until you make some assumptions about the force structure and take relativistic force propagation into account.</p><p>Of course, you don't want to hang around when a pair of Vogon infinite-tape splice ships converge with the severed ends in tow, especially if you cut between syllables of their favourite Vogon haiku.  Your hang-time margin of survival is determined by the unknown universal constant Vogons/linear parsec.</p></div>
	</htmltext>
<tokenext>Until he installs an infinite tape , this is computationally equivalent to a Finite Automata.Welcome to theoretic physics .
Hope you enjoy your career computing landscape probabilities over the 10 ^ 500 purported vacuum states .
Bring lots of sharp pencils , you 'll need them.Experimentally , this machine is indistinguishable from a real Turing machine until it whumps up against the end of the tape and the tape daemon refuses to splice a continuation tape .
This is known as Fermat 's procurement failure.Then again , there is no such thing as an observable distinction of a real Turing machine from a fake one , since it takes an infinite amount of time to observe that the tape in infinite in length.Even if the universe had formed with a doubly-infinite tape stretching across the cosmic vastness , cosmic expansion will eventually stretch your tape faster than you can read it.It 's an interesting physics problem what happens if you have an infinite string at constant tension ( with a uniform mass of so many grams/meter ) what happens when you severe it into a pair of singly-infinite tapes .
Hmmm , you probably have to work with tension in N/m ^ 2 ( cross section ) and you still get problems with infinite acceleration at the end points until you make some assumptions about the force structure and take relativistic force propagation into account.Of course , you do n't want to hang around when a pair of Vogon infinite-tape splice ships converge with the severed ends in tow , especially if you cut between syllables of their favourite Vogon haiku .
Your hang-time margin of survival is determined by the unknown universal constant Vogons/linear parsec .</tokentext>
<sentencetext>Until he installs an infinite tape, this is computationally equivalent to a Finite Automata.Welcome to theoretic physics.
Hope you enjoy your career computing landscape probabilities over the 10^500 purported vacuum states.
Bring lots of sharp pencils, you'll need them.Experimentally, this machine is indistinguishable from a real Turing machine until it whumps up against the end of the tape and the tape daemon refuses to splice a continuation tape.
This is known as Fermat's procurement failure.Then again, there is no such thing as an observable distinction of a real Turing machine from a fake one, since it takes an infinite amount of time to observe that the tape in infinite in length.Even if the universe had formed with a doubly-infinite tape stretching across the cosmic vastness, cosmic expansion will eventually stretch your tape faster than you can read it.It's an interesting physics problem what happens if you have an infinite string at constant tension (with a uniform mass of so many grams/meter) what happens when you severe it into a pair of singly-infinite tapes.
Hmmm, you probably have to work with tension in N/m^2 (cross section) and you still get problems with infinite acceleration at the end points until you make some assumptions about the force structure and take relativistic force propagation into account.Of course, you don't want to hang around when a pair of Vogon infinite-tape splice ships converge with the severed ends in tow, especially if you cut between syllables of their favourite Vogon haiku.
Your hang-time margin of survival is determined by the unknown universal constant Vogons/linear parsec.
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629824</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629398</id>
	<title>You're Doing It Wrong</title>
	<author>slimjim8094</author>
	<datestamp>1269629280000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>As far as I can see, he's using a microcontroller which is, itself, Turing-complete. So it's still only emulating a Turing machine (just with physical tape, instead of an emulator on your computer).</p><p>The point of a real Turing machine is that the logic is emergent from the individually-useless instructions on the tape. This is interesting from a hardware perspective, but in this instance the tape itself isn't the program - it's all the microcontroller</p></htmltext>
<tokenext>As far as I can see , he 's using a microcontroller which is , itself , Turing-complete .
So it 's still only emulating a Turing machine ( just with physical tape , instead of an emulator on your computer ) .The point of a real Turing machine is that the logic is emergent from the individually-useless instructions on the tape .
This is interesting from a hardware perspective , but in this instance the tape itself is n't the program - it 's all the microcontroller</tokentext>
<sentencetext>As far as I can see, he's using a microcontroller which is, itself, Turing-complete.
So it's still only emulating a Turing machine (just with physical tape, instead of an emulator on your computer).The point of a real Turing machine is that the logic is emergent from the individually-useless instructions on the tape.
This is interesting from a hardware perspective, but in this instance the tape itself isn't the program - it's all the microcontroller</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31632750</id>
	<title>I'm impressed</title>
	<author>the\_other\_chewey</author>
	<datestamp>1269599040000</datestamp>
	<modclass>Funny</modclass>
	<modscore>5</modscore>
	<htmltext>Im impressed: For an infinite tape, the reels look very compact.</htmltext>
<tokenext>Im impressed : For an infinite tape , the reels look very compact .</tokentext>
<sentencetext>Im impressed: For an infinite tape, the reels look very compact.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630874</id>
	<title>Re:Technically...</title>
	<author>itsdapead</author>
	<datestamp>1269634800000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>I think what we have here is something that can implement a large subset of Turing machines (i.e. specific initial tape/state table combinations) but falls short of being a <i>universal</i> Turing machine because there will always be computable algorithms that it can't run because of (a) lack of tape or (b) tape melting due to the sun leaving the main sequence.

</p><p>My call would be that you can't have a physical implementation of a true universal Turing machine - because you need to be able to "run" a non-computable algorithm "to completion" in order to prove that it used infinite tape or infinite steps (of course, with an abstract Turing machine you'd do it analytically, in the same way that you can use math to add up all the numbers in an infinite series, rather than empirically).

</p><p>Notwithstanding: hail the Ubergeek. This is sooooooo cool! Pointlessness only adds to its coolness!</p></htmltext>
<tokenext>I think what we have here is something that can implement a large subset of Turing machines ( i.e .
specific initial tape/state table combinations ) but falls short of being a universal Turing machine because there will always be computable algorithms that it ca n't run because of ( a ) lack of tape or ( b ) tape melting due to the sun leaving the main sequence .
My call would be that you ca n't have a physical implementation of a true universal Turing machine - because you need to be able to " run " a non-computable algorithm " to completion " in order to prove that it used infinite tape or infinite steps ( of course , with an abstract Turing machine you 'd do it analytically , in the same way that you can use math to add up all the numbers in an infinite series , rather than empirically ) .
Notwithstanding : hail the Ubergeek .
This is sooooooo cool !
Pointlessness only adds to its coolness !</tokentext>
<sentencetext>I think what we have here is something that can implement a large subset of Turing machines (i.e.
specific initial tape/state table combinations) but falls short of being a universal Turing machine because there will always be computable algorithms that it can't run because of (a) lack of tape or (b) tape melting due to the sun leaving the main sequence.
My call would be that you can't have a physical implementation of a true universal Turing machine - because you need to be able to "run" a non-computable algorithm "to completion" in order to prove that it used infinite tape or infinite steps (of course, with an abstract Turing machine you'd do it analytically, in the same way that you can use math to add up all the numbers in an infinite series, rather than empirically).
Notwithstanding: hail the Ubergeek.
This is sooooooo cool!
Pointlessness only adds to its coolness!</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629394</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629562</id>
	<title>Re:You're Doing It Wrong</title>
	<author>spribyl</author>
	<datestamp>1269629820000</datestamp>
	<modclass>Troll</modclass>
	<modscore>1</modscore>
	<htmltext><p>That was my thought as well, shouldn't the program and data be on the tape.</p></htmltext>
<tokenext>That was my thought as well , should n't the program and data be on the tape .</tokentext>
<sentencetext>That was my thought as well, shouldn't the program and data be on the tape.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629398</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630508</id>
	<title>The answer to the ultimate question...</title>
	<author>Anonymous</author>
	<datestamp>1269633180000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>Has it computed 42 yet?</p></htmltext>
<tokenext>Has it computed 42 yet ?</tokentext>
<sentencetext>Has it computed 42 yet?</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630220</id>
	<title>Re:Finite State Machine</title>
	<author>pz</author>
	<datestamp>1269632100000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p><div class="quote"><p>Until he installs an infitite tape, this is computationaly equivalent to a Finite Automata.</p></div><p>If you're going to be pedantic, then get it right --- the machine is computationally equivalent to a finite automaton.</p><p>What I find tickling about this implementation is the clear evidence of an embedded FSM emulating the programmed TM.  Since the erase, write, and read portions of the head are physically displaced, the interpreter needs to shift the tape back and forth to execute a simple TM operation like "read symbol at current location" or "write a 1 at current location".  Then, of course, there are the much more complicated portions of the FSM that perform optical character recognition, or actuate the marker to draw a zero or one symbol (too cool!).  Still, a very, very nifty machine, and quite a creative solution to the problem of an erasable tape that is human and machine readable at the same time!</p></div>
	</htmltext>
<tokenext>Until he installs an infitite tape , this is computationaly equivalent to a Finite Automata.If you 're going to be pedantic , then get it right --- the machine is computationally equivalent to a finite automaton.What I find tickling about this implementation is the clear evidence of an embedded FSM emulating the programmed TM .
Since the erase , write , and read portions of the head are physically displaced , the interpreter needs to shift the tape back and forth to execute a simple TM operation like " read symbol at current location " or " write a 1 at current location " .
Then , of course , there are the much more complicated portions of the FSM that perform optical character recognition , or actuate the marker to draw a zero or one symbol ( too cool ! ) .
Still , a very , very nifty machine , and quite a creative solution to the problem of an erasable tape that is human and machine readable at the same time !</tokentext>
<sentencetext>Until he installs an infitite tape, this is computationaly equivalent to a Finite Automata.If you're going to be pedantic, then get it right --- the machine is computationally equivalent to a finite automaton.What I find tickling about this implementation is the clear evidence of an embedded FSM emulating the programmed TM.
Since the erase, write, and read portions of the head are physically displaced, the interpreter needs to shift the tape back and forth to execute a simple TM operation like "read symbol at current location" or "write a 1 at current location".
Then, of course, there are the much more complicated portions of the FSM that perform optical character recognition, or actuate the marker to draw a zero or one symbol (too cool!).
Still, a very, very nifty machine, and quite a creative solution to the problem of an erasable tape that is human and machine readable at the same time!
	</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629824</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31637610</id>
	<title>Turing on using human computer as 'Paper Machine':</title>
	<author>D4C5CE</author>
	<datestamp>1269723420000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>As Alan M. Turing himself <a href="http://www.alanturing.net/turing\_archive/archive/l/l32/L32-006.gif" title="alanturing.net">wrote</a> [alanturing.net] in his 1948 National Physical Laboratory report on Intelligent Machinery (<a href="http://ijlit.oxfordjournals.org/cgi/content/full/14/3/257?ijkey=rF2MI0t8NYrGuJJ&amp;keytype=ref#RFN234" title="oxfordjournals.org">transcript</a> [oxfordjournals.org] from a law journal, of all places):<blockquote><div><p>It is possible to produce the effect of a computing machine by writing down a set of rules of procedure and asking a man to carry them out. Such a combination of a man with written instructions will be called a &lsquo;Paper Machine.&rsquo; A man provided with paper, pencil and rubber, and subject to strict discipline is in effect a universal machine.</p></div></blockquote></div>
	</htmltext>
<tokenext>As Alan M. Turing himself wrote [ alanturing.net ] in his 1948 National Physical Laboratory report on Intelligent Machinery ( transcript [ oxfordjournals.org ] from a law journal , of all places ) : It is possible to produce the effect of a computing machine by writing down a set of rules of procedure and asking a man to carry them out .
Such a combination of a man with written instructions will be called a    Paper Machine.    A man provided with paper , pencil and rubber , and subject to strict discipline is in effect a universal machine .</tokentext>
<sentencetext>As Alan M. Turing himself wrote [alanturing.net] in his 1948 National Physical Laboratory report on Intelligent Machinery (transcript [oxfordjournals.org] from a law journal, of all places):It is possible to produce the effect of a computing machine by writing down a set of rules of procedure and asking a man to carry them out.
Such a combination of a man with written instructions will be called a ‘Paper Machine.’ A man provided with paper, pencil and rubber, and subject to strict discipline is in effect a universal machine.
	</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631756</id>
	<title>Beowulf cluster</title>
	<author>Conditioner</author>
	<datestamp>1269595080000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext>Imagine a Beowulf cluster of there... it wouldn't amount to much =/</htmltext>
<tokenext>Imagine a Beowulf cluster of there... it would n't amount to much = /</tokentext>
<sentencetext>Imagine a Beowulf cluster of there... it wouldn't amount to much =/</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630594</id>
	<title>Arrangement</title>
	<author>sugarmotor</author>
	<datestamp>1269633540000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><tt>Having worked in recursion theory, my (mental) picture of a Turing Machine is a little different.<br><br>The tape is vertical, and the head writes and reads from the side. The "state-transition table" is next<br><br>O\_\_\_\_\_\_\_\_\_\_O<br>&nbsp; &nbsp; &nbsp;^<br>&nbsp; &nbsp; &nbsp;!<br>[&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; ]<br><br>Stephan</tt></htmltext>
<tokenext>Having worked in recursion theory , my ( mental ) picture of a Turing Machine is a little different.The tape is vertical , and the head writes and reads from the side .
The " state-transition table " is nextO \ _ \ _ \ _ \ _ \ _ \ _ \ _ \ _ \ _ \ _O       ^       !
[           ] Stephan</tokentext>
<sentencetext>Having worked in recursion theory, my (mental) picture of a Turing Machine is a little different.The tape is vertical, and the head writes and reads from the side.
The "state-transition table" is nextO\_\_\_\_\_\_\_\_\_\_O     ^     !
[          ]Stephan</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629810</id>
	<title>Setting aside the Turing stuff...</title>
	<author>Anonymous</author>
	<datestamp>1269630540000</datestamp>
	<modclass>Insightful</modclass>
	<modscore>5</modscore>
	<htmltext>The hardware is <b>very<b> elegant and well-done.  The guy is a multi-talented geek of the highest order.</b></b></htmltext>
<tokenext>The hardware is very elegant and well-done .
The guy is a multi-talented geek of the highest order .</tokentext>
<sentencetext>The hardware is very elegant and well-done.
The guy is a multi-talented geek of the highest order.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629824</id>
	<title>Finite State Machine</title>
	<author>Jason1729</author>
	<datestamp>1269630600000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>Until he installs an infitite tape, this is computationaly equivalent to a Finite Automata.</htmltext>
<tokenext>Until he installs an infitite tape , this is computationaly equivalent to a Finite Automata .</tokentext>
<sentencetext>Until he installs an infitite tape, this is computationaly equivalent to a Finite Automata.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31632482</id>
	<title>Re:Cool...I think.</title>
	<author>thrawn\_aj</author>
	<datestamp>1269598020000</datestamp>
	<modclass>Interestin</modclass>
	<modscore>2</modscore>
	<htmltext>Who modded this 'troll'? Are people not allowed to muse wonderingly anymore? Sheesh, some people need to unclench. <br> <br>

Personally, having been entirely fascinated with Turing and his work during my college years (from a mathematical point of view  - the <a href="http://en.wikipedia.org/wiki/Entscheidungsproblem" title="wikipedia.org">Entscheidungsproblem</a> [wikipedia.org] rather than CS), seeing an actual Turing machine sends shivers up my spine. Kudos! <br> <br>

For anyone interested in knowing more about this fascinating scientist, I recommend <a href="http://www.amazon.com/Alan-Turing-Enigma-Andrew-Hodges/dp/0802775802/ref=pd\_sim\_b\_5" title="amazon.com">the book by Andrew Hodges</a> [amazon.com].</htmltext>
<tokenext>Who modded this 'troll ' ?
Are people not allowed to muse wonderingly anymore ?
Sheesh , some people need to unclench .
Personally , having been entirely fascinated with Turing and his work during my college years ( from a mathematical point of view - the Entscheidungsproblem [ wikipedia.org ] rather than CS ) , seeing an actual Turing machine sends shivers up my spine .
Kudos ! For anyone interested in knowing more about this fascinating scientist , I recommend the book by Andrew Hodges [ amazon.com ] .</tokentext>
<sentencetext>Who modded this 'troll'?
Are people not allowed to muse wonderingly anymore?
Sheesh, some people need to unclench.
Personally, having been entirely fascinated with Turing and his work during my college years (from a mathematical point of view  - the Entscheidungsproblem [wikipedia.org] rather than CS), seeing an actual Turing machine sends shivers up my spine.
Kudos!  

For anyone interested in knowing more about this fascinating scientist, I recommend the book by Andrew Hodges [amazon.com].</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629206</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631432</id>
	<title>Great Job !</title>
	<author>Anonymous</author>
	<datestamp>1269637080000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>Really Great Job !</p></htmltext>
<tokenext>Really Great Job !</tokentext>
<sentencetext>Really Great Job !</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629304</id>
	<title>Re:Cool...I think.</title>
	<author>91degrees</author>
	<datestamp>1269628920000</datestamp>
	<modclass>Insightful</modclass>
	<modscore>4</modscore>
	<htmltext>I don't think it has been done before though.  At least not as a hardware implementation.  The reason being that while it's an interesting hypohetical machine, it's extremely inefficient means of computing anything. But it is very nice to actually see a visualisation of such a machine</htmltext>
<tokenext>I do n't think it has been done before though .
At least not as a hardware implementation .
The reason being that while it 's an interesting hypohetical machine , it 's extremely inefficient means of computing anything .
But it is very nice to actually see a visualisation of such a machine</tokentext>
<sentencetext>I don't think it has been done before though.
At least not as a hardware implementation.
The reason being that while it's an interesting hypohetical machine, it's extremely inefficient means of computing anything.
But it is very nice to actually see a visualisation of such a machine</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629206</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31645348</id>
	<title>Did anyone else read that as:</title>
	<author>Hurricane78</author>
	<datestamp>1269714600000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>&ldquo;Home-Built Time Machine&rdquo;?</p><p>For a tiny moment there, my heart jumped.<nobr> <wbr></nobr>:/</p></htmltext>
<tokenext>   Home-Built Time Machine    ? For a tiny moment there , my heart jumped .
: /</tokentext>
<sentencetext>“Home-Built Time Machine”?For a tiny moment there, my heart jumped.
:/</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629604</id>
	<title>All in the head?</title>
	<author>s-gen</author>
	<datestamp>1269629940000</datestamp>
	<modclass>Insightful</modclass>
	<modscore>3</modscore>
	<htmltext>A turing machine isn't just the head and the tape, its those things plus a state transition table. The microcontroller is doing the state transition table part.</htmltext>
<tokenext>A turing machine is n't just the head and the tape , its those things plus a state transition table .
The microcontroller is doing the state transition table part .</tokentext>
<sentencetext>A turing machine isn't just the head and the tape, its those things plus a state transition table.
The microcontroller is doing the state transition table part.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629398</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629626</id>
	<title>Re:You're Doing It Wrong</title>
	<author>HateBreeder</author>
	<datestamp>1269630000000</datestamp>
	<modclass>Informativ</modclass>
	<modscore>2</modscore>
	<htmltext><p>Actually, if you'd bother reading the article, you'd find that the micro-controller is being used to do drive the electric motors, image process and maintain the turing machine's <a href="http://en.wikipedia.org/wiki/Turing\_machine#The\_.22state.22" title="wikipedia.org">"state"</a> [wikipedia.org]. that's it.</p></htmltext>
<tokenext>Actually , if you 'd bother reading the article , you 'd find that the micro-controller is being used to do drive the electric motors , image process and maintain the turing machine 's " state " [ wikipedia.org ] .
that 's it .</tokentext>
<sentencetext>Actually, if you'd bother reading the article, you'd find that the micro-controller is being used to do drive the electric motors, image process and maintain the turing machine's "state" [wikipedia.org].
that's it.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629398</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31654172</id>
	<title>Calculate anythihng?</title>
	<author>Modern Primate</author>
	<datestamp>1269894000000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>A machine that can calculate anything, regardless of complexity?

I, for one, welcome our new garage-built overlords.</htmltext>
<tokenext>A machine that can calculate anything , regardless of complexity ?
I , for one , welcome our new garage-built overlords .</tokentext>
<sentencetext>A machine that can calculate anything, regardless of complexity?
I, for one, welcome our new garage-built overlords.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631370</id>
	<title>Re:"Parallax Propeller chip-based controller"</title>
	<author>Sulphur</author>
	<datestamp>1269636780000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>No relays. How sad.</p><p>Nice use of Spaceley Sprockets though.</p></htmltext>
<tokenext>No relays .
How sad.Nice use of Spaceley Sprockets though .</tokentext>
<sentencetext>No relays.
How sad.Nice use of Spaceley Sprockets though.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629382</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629248</id>
	<title>Know what I'm thinking?</title>
	<author>Anonymous</author>
	<datestamp>1269628740000</datestamp>
	<modclass>Funny</modclass>
	<modscore>4</modscore>
	<htmltext><p>Hot Tub Turing Machine!</p></htmltext>
<tokenext>Hot Tub Turing Machine !</tokentext>
<sentencetext>Hot Tub Turing Machine!</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629550</id>
	<title>Re:You're Doing It Wrong</title>
	<author>trurl7</author>
	<datestamp>1269629760000</datestamp>
	<modclass>Informativ</modclass>
	<modscore>5</modscore>
	<htmltext><p>RTFA.  I know that's a sin, but seriously, do.  You'll discover you are wrong.</p><p>The microcontroller loads the program as written in ascii on an SD card.  It also can write the initial data onto the tape.  After that, the computation is, indeed, performed by the "machine".  Hence the optical reader for the characters on the tape.</p></htmltext>
<tokenext>RTFA .
I know that 's a sin , but seriously , do .
You 'll discover you are wrong.The microcontroller loads the program as written in ascii on an SD card .
It also can write the initial data onto the tape .
After that , the computation is , indeed , performed by the " machine " .
Hence the optical reader for the characters on the tape .</tokentext>
<sentencetext>RTFA.
I know that's a sin, but seriously, do.
You'll discover you are wrong.The microcontroller loads the program as written in ascii on an SD card.
It also can write the initial data onto the tape.
After that, the computation is, indeed, performed by the "machine".
Hence the optical reader for the characters on the tape.</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629398</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31634166</id>
	<title>Re:Know what I'm thinking?</title>
	<author>Anonymous</author>
	<datestamp>1269606900000</datestamp>
	<modclass>None</modclass>
	<modscore>0</modscore>
	<htmltext><p>Turing himself would have approved! The then British government didn't so much..</p></htmltext>
<tokenext>Turing himself would have approved !
The then British government did n't so much. .</tokentext>
<sentencetext>Turing himself would have approved!
The then British government didn't so much..</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629248</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629382</id>
	<title>"Parallax Propeller chip-based controller"</title>
	<author>Anonymous</author>
	<datestamp>1269629220000</datestamp>
	<modclass>Funny</modclass>
	<modscore>3</modscore>
	<htmltext><p>No relays.  How sad.</p></htmltext>
<tokenext>No relays .
How sad .</tokentext>
<sentencetext>No relays.
How sad.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31633628</id>
	<title>Re:"Parallax Propeller chip-based controller"</title>
	<author>517714</author>
	<datestamp>1269603660000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>No relays Hell!  I want steam!</htmltext>
<tokenext>No relays Hell !
I want steam !</tokentext>
<sentencetext>No relays Hell!
I want steam!</sentencetext>
	<parent>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629382</parent>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629394</id>
	<title>Technically...</title>
	<author>Anonymous</author>
	<datestamp>1269629280000</datestamp>
	<modclass>Insightful</modclass>
	<modscore>5</modscore>
	<htmltext>Purely technically, a Turing Machine that hasn't infinite tapes is simply a Finite State Machine.  You cannot build a "real" Turing Machine.  Doesn't make his creation less interesting though<nobr> <wbr></nobr>:-)</htmltext>
<tokenext>Purely technically , a Turing Machine that has n't infinite tapes is simply a Finite State Machine .
You can not build a " real " Turing Machine .
Does n't make his creation less interesting though : - )</tokentext>
<sentencetext>Purely technically, a Turing Machine that hasn't infinite tapes is simply a Finite State Machine.
You cannot build a "real" Turing Machine.
Doesn't make his creation less interesting though :-)</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629792</id>
	<title>Turing Machine=Mathematician Without Insight</title>
	<author>aaaaaaargh!</author>
	<datestamp>1269630540000</datestamp>
	<modclass>Funny</modclass>
	<modscore>4</modscore>
	<htmltext><p>A Turing machine is supposed to represent what an infinitely patient mathematician with no insight can achieve when he has an infinite amount of paper and pencils. Obviously, the infinity here poses some problems, but you can build a finite Turing machine by finding a mathematician that has no insights,giving him tranquilizers to make him more patient, and locking him into your basement with some food and papers and pencils.</p></htmltext>
<tokenext>A Turing machine is supposed to represent what an infinitely patient mathematician with no insight can achieve when he has an infinite amount of paper and pencils .
Obviously , the infinity here poses some problems , but you can build a finite Turing machine by finding a mathematician that has no insights,giving him tranquilizers to make him more patient , and locking him into your basement with some food and papers and pencils .</tokentext>
<sentencetext>A Turing machine is supposed to represent what an infinitely patient mathematician with no insight can achieve when he has an infinite amount of paper and pencils.
Obviously, the infinity here poses some problems, but you can build a finite Turing machine by finding a mathematician that has no insights,giving him tranquilizers to make him more patient, and locking him into your basement with some food and papers and pencils.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630460</id>
	<title>Turing tested and approved?</title>
	<author>OzPeter</author>
	<datestamp>1269633060000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext>So does this technically pass the Turing test?</htmltext>
<tokenext>So does this technically pass the Turing test ?</tokentext>
<sentencetext>So does this technically pass the Turing test?</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629232</id>
	<title>hmmm</title>
	<author>Denihil</author>
	<datestamp>1269628680000</datestamp>
	<modclass>Insightful</modclass>
	<modscore>3</modscore>
	<htmltext>maybe i'm missing something but i'm used to people talking about "turing machines" as a machine that is "turing-complete", not looking like a hypothetical turing machine he described in his paper. Is this aesthetics over the principle he meant it to be taken by? Cool hardhack though btw, love to have one of those on my coffee table.</htmltext>
<tokenext>maybe i 'm missing something but i 'm used to people talking about " turing machines " as a machine that is " turing-complete " , not looking like a hypothetical turing machine he described in his paper .
Is this aesthetics over the principle he meant it to be taken by ?
Cool hardhack though btw , love to have one of those on my coffee table .</tokentext>
<sentencetext>maybe i'm missing something but i'm used to people talking about "turing machines" as a machine that is "turing-complete", not looking like a hypothetical turing machine he described in his paper.
Is this aesthetics over the principle he meant it to be taken by?
Cool hardhack though btw, love to have one of those on my coffee table.</sentencetext>
</comment>
<comment>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631426</id>
	<title>Non-infinite</title>
	<author>Anonymous</author>
	<datestamp>1269637020000</datestamp>
	<modclass>None</modclass>
	<modscore>1</modscore>
	<htmltext><p>Should be finite.</p></htmltext>
<tokenext>Should be finite .</tokentext>
<sentencetext>Should be finite.</sentencetext>
</comment>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_18</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629604
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629398
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_15</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631374
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629232
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_19</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630292
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629394
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_23</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630672
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629810
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_1</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631158
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630220
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629824
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_5</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630874
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629394
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_21</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631566
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630720
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_20</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629808
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629550
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629398
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_25</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631440
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630388
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_24</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631370
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629382
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_3</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630538
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629398
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_2</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31633346
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629824
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_9</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31632482
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629206
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_12</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629304
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629206
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_6</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31643186
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629810
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_22</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31633628
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629382
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_16</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631634
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629232
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_0</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631720
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630388
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_7</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629886
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629398
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_13</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631430
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629810
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_10</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31633254
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629810
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_26</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629626
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629398
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_4</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630722
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629394
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_17</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31634166
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629248
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_14</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629562
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629398
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_8</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630336
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629394
</commentlist>
</thread>
<thread>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#thread_10_03_26_1645218_11</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31633202
http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629810
</commentlist>
</thread>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_03_26_1645218.0</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629824
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630220
--http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631158
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31633346
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_03_26_1645218.14</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629232
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631634
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631374
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_03_26_1645218.12</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629358
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_03_26_1645218.7</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629248
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31634166
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_03_26_1645218.5</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631682
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_03_26_1645218.16</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630594
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_03_26_1645218.8</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629392
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_03_26_1645218.9</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629792
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_03_26_1645218.13</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630720
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631566
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_03_26_1645218.10</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629206
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31632482
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629304
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_03_26_1645218.11</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629382
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31633628
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631370
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_03_26_1645218.6</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630388
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631440
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631720
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_03_26_1645218.4</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629394
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630874
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630292
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630722
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630336
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_03_26_1645218.3</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629810
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31643186
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31633202
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631430
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31633254
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630672
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_03_26_1645218.15</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31631426
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_03_26_1645218.1</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629398
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629604
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629886
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630538
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629626
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629562
-http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629550
--http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31629808
</commentlist>
</conversation>
<conversation>
	<id>http://www.semanticweb.org/ontologies/ConversationInstances.owl#conversation10_03_26_1645218.2</id>
	<commentlist>http://www.semanticweb.org/ontologies/ConversationInstances.owl#comment10_03_26_1645218.31630460
</commentlist>
</conversation>
