Talk:Wireworld

More Images
I'll try to make and upload some images of the patterns I mentioned in the Applications section. I think the images already on this article are extremely helpful in illustrating how Wireworld works, and I think images of larger patterns will help put things in perspective. I'll first attempt to get permission from the creators, and then archive the request if successful. This means the process may take some time. Alpha Omicron 14:13, 11 April 2007 (UTC)


 * Request for permission to use image of Wireworld computer was denied. Alpha Omicron 20:19, 12 April 2007 (UTC)
 * Hmm, it seems pretty large anyway, it'd probably look horrible if you had to scale it down. Uberkris 07:56, 4 September 2007 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified one external link on Wireworld. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20110204063835/http://www.heise.ws/wireworld.html to http://www.heise.ws/wireworld.html

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 02:07, 22 March 2017 (UTC)

Turing-complete?
A medium is Turing-complete if it can compute every Turing-computable function. Put another way, if it can replicate the functionality of all Turing machines. When a Turing machine runs, it allocates a finite amount of tape. But it is not possible to anticipate how much tape an arbitrary algorithm requires. As such, a Turing machine needs an unlimited supply. This is often referred to as "finite, but unbounded". The only way to achieve the effect in Wireworld is to build an infinitely long register circuit. But in a Turing machine, the region of tape not containing the algorithm must be blank. What is the blank region of such an infinite construction? — Preceding unsigned comment added by 69.27.238.209 (talk) 17:32, 10 July 2024 (UTC)
 * These Turing-completeness claims for cellular automata often assume an infinite repeating background pattern rather than a blank background pattern. The "finite" part of the pattern is the part that differs from the infinite repeating pattern. You can argue whether that's a fair definition but it's the one that's used. That appears to be the case here as well. So there can be some infinite repeating background blank memory circuit with a finite perturbation where all the computation happens. —David Eppstein (talk) 18:35, 10 July 2024 (UTC)