Talk:205: Candy Button Paper

2013-07-06T16:03:21Z

69.163.36.90:

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. [[Special:Contributions/69.163.36.90|69.163.36.90]] 16:01, 6 July 2013 (UTC)

Talk:205: Candy Button Paper

2013-07-06T16:01:06Z

69.163.36.90: Created page with "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 particu..."

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. [[Special:Contributions/69.163.36.90|69.163.36.90]] 16:01, 6 July 2013 (UTC)

explain xkcd - User contributions [en]

Talk:205: Candy Button Paper

Talk:205: Candy Button Paper