Difference between revisions of "Talk:205: Candy Button Paper"
(my opinion) |
|||
| Line 5: | Line 5: | ||
:In my opinion, intuitively, when writing is demanded, a turing machine just have to copy those symbols to a new location, minding the symbol that needs to be written. It can have a start-of-data mark so this would be transparent to other operations [[Special:Contributions/173.245.48.96|173.245.48.96]] 05:45, 27 July 2014 (UTC) | :In my opinion, intuitively, when writing is demanded, a turing machine just have to copy those symbols to a new location, minding the symbol that needs to be written. It can have a start-of-data mark so this would be transparent to other operations [[Special:Contributions/173.245.48.96|173.245.48.96]] 05:45, 27 July 2014 (UTC) | ||
| + | |||
| + | so I'm the only one that put them in a loop, then moved it one button down on one side? | ||
Revision as of 06:10, 8 February 2016
It is possible to run a Turing machine on a candy belt:
Marvin Minsky (1967), Computation: Finite and Infinite Machines, Prentice-Hall, Inc. Englewood Cliffs, N.J. In particular see p. 262ff (italics in original): "We can now demonstrate the remarkable fact, first shown by Wang [1957], that for any Turing machine T there is an equivalent Turing machine TN that never changes a once-written symbol! In fact, we will construct a two-symbol machine TN that can only change blank squares on its tape to 1's but can not change a 1 back to a blank." Minsky then offers a proof of this. -- Kopa Leo 69.163.36.90 16:01, 6 July 2013 (UTC)
- In my opinion, intuitively, when writing is demanded, a turing machine just have to copy those symbols to a new location, minding the symbol that needs to be written. It can have a start-of-data mark so this would be transparent to other operations 173.245.48.96 05:45, 27 July 2014 (UTC)
so I'm the only one that put them in a loop, then moved it one button down on one side?
