Editing Talk:2556: Turing Complete

Jump to: navigation, search
Ambox notice.png Please sign your posts with ~~~~

Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision Your text
Line 9: Line 9:
 
The explanation should probably also mention that https://googleprojectzero.blogspot.com/2021/12/a-deep-dive-into-nso-zero-click.html was published just two days before this comic. Frank [[Special:Contributions/162.158.94.165|162.158.94.165]] 11:09, 18 December 2021 (UTC)
 
The explanation should probably also mention that https://googleprojectzero.blogspot.com/2021/12/a-deep-dive-into-nso-zero-click.html was published just two days before this comic. Frank [[Special:Contributions/162.158.94.165|162.158.94.165]] 11:09, 18 December 2021 (UTC)
  
I added in a much needed [[A Bunch of Rocks]] reference. I mean, it's a possibly ''broken'' Turing Machine (because the operator is 'only human' and occasionally makes mistakes in his process. But, by definition, anything capable of simulating (many!) things that are themselves considered Turing Complete is thus by itself Turing Complete as it carries out (or could carry out) all the tasks that are successfully (or potentially) carried out by them 'on their own'. It's a metaphysical (metaphilosophical? metasomethingorother...) issue, of course. ;) [[Special:Contributions/172.70.91.84|172.70.91.84]] 00:29, 19 December 2021 (UTC)
+
I added in a much needed A Bunch Of Rocks reference. I mean, it's a possibly ''broken'' Turing Machine (because the operator is 'only human' and occasionally makes mistakes in his process. But, by definition, anything capable of simulating (many!) things that are themselves considered Turing Complete is thus by itself Turing Complete as it carries out (or could carry out) all the tasks that are successfully (or potentially) carried out by them 'on their own'. It's a metaphysical (metaphilosophical? metasomethingorother...) issue, of course. ;) [[Special:Contributions/172.70.91.84|172.70.91.84]] 00:29, 19 December 2021 (UTC)
 
:(Actually, that was before I then went back and fully read ABOR, to fulfill my nostalgia. I forgot that it ''actually says'' it is TC in an in-frame footnote. That might be what prompted me to think of it, so forget about me being too clever, it's just true. Voice Of God, etc.) [[Special:Contributions/172.70.91.84|172.70.91.84]] 00:34, 19 December 2021 (UTC)
 
:(Actually, that was before I then went back and fully read ABOR, to fulfill my nostalgia. I forgot that it ''actually says'' it is TC in an in-frame footnote. That might be what prompted me to think of it, so forget about me being too clever, it's just true. Voice Of God, etc.) [[Special:Contributions/172.70.91.84|172.70.91.84]] 00:34, 19 December 2021 (UTC)
::It is also one of my favorite and I remember the footnote without reading it again now ;-) Wow a dust mote just disappeared in front of me... :-D (updated your post with a link to the comic!) --[[User:Kynde|Kynde]] ([[User talk:Kynde|talk]]) 08:03, 20 December 2021 (UTC)
 
 
Do things feel more and more like Stross's Accelerando to you as well? [[Special:Contributions/172.68.246.129|172.68.246.129]] 09:09, 22 December 2021 (UTC)
 
 
Honestly surprised Randall didn't reference Doom in this comic. It's the one game that's synonymous with running on unusual hardware. [[Special:Contributions/172.70.85.79|172.70.85.79]] 23:41, 23 December 2021 (UTC)
 
 
== Weird Machines and Turing Completeness ==
 
 
This comic is closely related to the language security work on weird machines, yes? Could someone more knowledgeable comment?--[[User:Philip Romolo Neri|Philip Romolo Neri]] ([[User talk:Philip Romolo Neri|talk]]) 09:25, 10 January 2022 (UTC)
 
 
== ==
 
A Turing tape is unbounded, not infinite. At any given time, only a finite number of symbols have been read or written, but that number can grow without limit over time. In principle, a real-world machine that was able to request more memory whenever it ran out of what it had could be considered equally unbounded - at least if the universe is infinite. [[User:Brangdon|Brangdon]] ([[User talk:Brangdon|talk]]) 13:14, 23 April 2022 (UTC)
 

Please note that all contributions to explain xkcd may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see explain xkcd:Copyrights for details). Do not submit copyrighted work without permission!

To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:

Cancel | Editing help (opens in new window)