Editing Talk:2556: Turing Complete

<!--Please sign your posts with ~~~~ and don't delete this text. New comments should be added at the bottom.-->

This is a reference to the new FORCEDENTRY exploit analysis by Google's project zero: https://googleprojectzero.blogspot.com/2021/12/a-deep-dive-into-nso-zero-click.html
The exploit runs a full (turing-complete) VM within a PDF decompression algorithm. [[Special:Contributions/172.70.86.68|172.70.86.68]] 22:37, 17 December 2021 (UTC)

I don't think "attack by a nation-state" is referring to Turing's WWII work. I think it means a modern nation-state is using FORCEDENTRY to attack you via some unexpected device. [[User:Barmar|Barmar]] ([[User talk:Barmar|talk]]) 23:56, 17 December 2021 (UTC)
: I think it actually is a reference to national security agencies being able to get into your phone and get all your private data and so on [[Special:Contributions/108.162.237.5|108.162.237.5]] 01:00, 18 December 2021 (UTC)Bumpf

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)
:(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)
@@ Line 20: / Line 20: @@
 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)