Talk:205: Candy Button Paper - Revision history

An user who has no account yet at 14:15, 6 September 2023

2023-09-06T14:15:42Z

172.70.206.151 at 08:38, 26 December 2021

2021-12-26T08:38:21Z

108.162.250.41: signing

2018-11-17T12:03:40Z

signing

108.162.250.41 at 12:03, 17 November 2018

2018-11-17T12:03:08Z

108.162.250.41: added a proof of write-once Turing machines, from Sipser's textbook.

2018-11-17T12:02:31Z

added a proof of write-once Turing machines, from Sipser's textbook.

162.158.186.60 at 21:14, 3 August 2017

2017-08-03T21:14:34Z

108.162.221.244 at 16:09, 30 March 2017

2017-03-30T16:09:42Z

625571b7-aa66-4f98-ac5c-92464cfb4ed8 at 14:28, 14 March 2017

2017-03-14T14:28:55Z

Lackadaisical: Undo revision 128074 by 108.162.241.123 (talk) We don't replace content of discussion board

2016-10-02T19:56:01Z

Undo revision 128074 by 108.162.241.123 (talk) We don't replace content of discussion board

108.162.241.123: Replaced content with "Candy button paper was around long before 1980. I remember it from the 1950s. ~~~~"

2016-10-02T17:59:34Z

Replaced content with "Candy button paper was around long before 1980. I remember it from the 1950s. ~~~~"

← Older revision		Revision as of 14:15, 6 September 2023
Line 24:		Line 24:
	[https://www.quora.com/Experienced-programmers-and-computer-scientists-what-are-some-really-old-or-even-nearly-forgotten-books-you-think-every-new-programmer-should-read/answer/Alan-Kay-11 Note: Alan Kay recommended] ''Computation: Finite and Infinite Machines'' as a classic.		[https://www.quora.com/Experienced-programmers-and-computer-scientists-what-are-some-really-old-or-even-nearly-forgotten-books-you-think-every-new-programmer-should-read/answer/Alan-Kay-11 Note: Alan Kay recommended] ''Computation: Finite and Infinite Machines'' as a classic.
	-- Kopa Leo [[Special:Contributions/172.70.206.151\|172.70.206.151]] 08:38, 26 December 2021 (UTC)		-- Kopa Leo [[Special:Contributions/172.70.206.151\|172.70.206.151]] 08:38, 26 December 2021 (UTC)
		+
		+	i was a weird mix between the 3 back in my day when eating similar candies: which one depended on the day [[User:An user who has no account yet\|An user who has no account yet]] ([[User talk:An user who has no account yet\|talk]]) 14:15, 6 September 2023 (UTC)

← Older revision		Revision as of 08:38, 26 December 2021
Line 21:		Line 21:

	To carry out the simulation with a write-once machine, operate as before, except that each cell of the previous tape is now represented by two cells. The first of these contains the original machine’s tape symbol and the second is for the mark used in the copying procedure. The input is not presented to the machine in the format with two cells per symbol, so the very first time the tape is copied, the copying marks are put directly over the input symbols. -- Kopa Leo [[Special:Contributions/108.162.250.41\|108.162.250.41]] 12:03, 17 November 2018 (UTC)		To carry out the simulation with a write-once machine, operate as before, except that each cell of the previous tape is now represented by two cells. The first of these contains the original machine’s tape symbol and the second is for the mark used in the copying procedure. The input is not presented to the machine in the format with two cells per symbol, so the very first time the tape is copied, the copying marks are put directly over the input symbols. -- Kopa Leo [[Special:Contributions/108.162.250.41\|108.162.250.41]] 12:03, 17 November 2018 (UTC)
		+
		+	[https://www.quora.com/Experienced-programmers-and-computer-scientists-what-are-some-really-old-or-even-nearly-forgotten-books-you-think-every-new-programmer-should-read/answer/Alan-Kay-11 Note: Alan Kay recommended] ''Computation: Finite and Infinite Machines'' as a classic.
		+	-- Kopa Leo [[Special:Contributions/172.70.206.151\|172.70.206.151]] 08:38, 26 December 2021 (UTC)

← Older revision		Revision as of 12:03, 17 November 2018
Line 20:		Line 20:
	We first simulate an ordinary Turing machine by a write-twice Turing machine. The write-twice machine simulates a single step of the original machine by copying the entire tape over to a fresh portion of the tape to the right-hand side of the currently used portion. The copying procedure operates character by character, marking a character as it is copied. This procedure alters each tape square twice, once to write the character for the first time and again to mark that it has been copied. The position of the original Turing machine’s tape head is marked on the tape. When copying the cells at, or adjacent to, the marked position, the tape contents is updated according to the rules of the original Turing machine.		We first simulate an ordinary Turing machine by a write-twice Turing machine. The write-twice machine simulates a single step of the original machine by copying the entire tape over to a fresh portion of the tape to the right-hand side of the currently used portion. The copying procedure operates character by character, marking a character as it is copied. This procedure alters each tape square twice, once to write the character for the first time and again to mark that it has been copied. The position of the original Turing machine’s tape head is marked on the tape. When copying the cells at, or adjacent to, the marked position, the tape contents is updated according to the rules of the original Turing machine.

−	To carry out the simulation with a write-once machine, operate as before, except that each cell of the previous tape is now represented by two cells. The first of these contains the original machine’s tape symbol and the second is for the mark used in the copying procedure. The input is not presented to the machine in the format with two cells per symbol, so the very first time the tape is copied, the copying marks are put directly over the input symbols. [[Special:Contributions/108.162.250.41\|108.162.250.41]] 12:03, 17 November 2018 (UTC)	+	To carry out the simulation with a write-once machine, operate as before, except that each cell of the previous tape is now represented by two cells. The first of these contains the original machine’s tape symbol and the second is for the mark used in the copying procedure. The input is not presented to the machine in the format with two cells per symbol, so the very first time the tape is copied, the copying marks are put directly over the input symbols. -- Kopa Leo [[Special:Contributions/108.162.250.41\|108.162.250.41]] 12:03, 17 November 2018 (UTC)

← Older revision		Revision as of 12:03, 17 November 2018
Line 20:		Line 20:
	We first simulate an ordinary Turing machine by a write-twice Turing machine. The write-twice machine simulates a single step of the original machine by copying the entire tape over to a fresh portion of the tape to the right-hand side of the currently used portion. The copying procedure operates character by character, marking a character as it is copied. This procedure alters each tape square twice, once to write the character for the first time and again to mark that it has been copied. The position of the original Turing machine’s tape head is marked on the tape. When copying the cells at, or adjacent to, the marked position, the tape contents is updated according to the rules of the original Turing machine.		We first simulate an ordinary Turing machine by a write-twice Turing machine. The write-twice machine simulates a single step of the original machine by copying the entire tape over to a fresh portion of the tape to the right-hand side of the currently used portion. The copying procedure operates character by character, marking a character as it is copied. This procedure alters each tape square twice, once to write the character for the first time and again to mark that it has been copied. The position of the original Turing machine’s tape head is marked on the tape. When copying the cells at, or adjacent to, the marked position, the tape contents is updated according to the rules of the original Turing machine.

−	To carry out the simulation with a write-once machine, operate as before, except that each cell of the previous tape is now represented by two cells. The first of these contains the original machine’s tape symbol and the second is for the mark used in the copying procedure. The input is not presented to the machine in the format with two cells per symbol, so the very first time the tape is copied, the copying marks are put directly over the input symbols.	+	To carry out the simulation with a write-once machine, operate as before, except that each cell of the previous tape is now represented by two cells. The first of these contains the original machine’s tape symbol and the second is for the mark used in the copying procedure. The input is not presented to the machine in the format with two cells per symbol, so the very first time the tape is copied, the copying marks are put directly over the input symbols. [[Special:Contributions/108.162.250.41\|108.162.250.41]] 12:03, 17 November 2018 (UTC)

← Older revision		Revision as of 12:02, 17 November 2018
Line 15:		Line 15:

	: There are two main strategies (careful and fast) and one very uncommon strategy (Turing). [[Special:Contributions/162.158.186.60\|162.158.186.60]] 21:14, 3 August 2017 (UTC)		: There are two main strategies (careful and fast) and one very uncommon strategy (Turing). [[Special:Contributions/162.158.186.60\|162.158.186.60]] 21:14, 3 August 2017 (UTC)
		+
		+	There's a proof from Sipser's Introduction to the Theory of Computation (2nd ed), [exercise 3.10: https://archive.org/stream/IntroductionToTheoryOfComputation/introduction%20to%20theory%20of%20computation_djvu.txt]:
		+
		+	We first simulate an ordinary Turing machine by a write-twice Turing machine. The write-twice machine simulates a single step of the original machine by copying the entire tape over to a fresh portion of the tape to the right-hand side of the currently used portion. The copying procedure operates character by character, marking a character as it is copied. This procedure alters each tape square twice, once to write the character for the first time and again to mark that it has been copied. The position of the original Turing machine’s tape head is marked on the tape. When copying the cells at, or adjacent to, the marked position, the tape contents is updated according to the rules of the original Turing machine.
		+
		+	To carry out the simulation with a write-once machine, operate as before, except that each cell of the previous tape is now represented by two cells. The first of these contains the original machine’s tape symbol and the second is for the mark used in the copying procedure. The input is not presented to the machine in the format with two cells per symbol, so the very first time the tape is copied, the copying marks are put directly over the input symbols.

← Older revision		Revision as of 21:14, 3 August 2017
Line 13:		Line 13:

	Doesn't Randall mention three different strategies? The comic says two, however.		Doesn't Randall mention three different strategies? The comic says two, however.
		+
		+	: There are two main strategies (careful and fast) and one very uncommon strategy (Turing). [[Special:Contributions/162.158.186.60\|162.158.186.60]] 21:14, 3 August 2017 (UTC)

← Older revision		Revision as of 16:09, 30 March 2017
Line 11:		Line 11:

	If candy buttons were two-sided, I would make it into a Möbius strip. [[User:625571b7-aa66-4f98-ac5c-92464cfb4ed8\|625571b7-aa66-4f98-ac5c-92464cfb4ed8]] ([[User talk:625571b7-aa66-4f98-ac5c-92464cfb4ed8\|talk]]) 14:28, 14 March 2017 (UTC)		If candy buttons were two-sided, I would make it into a Möbius strip. [[User:625571b7-aa66-4f98-ac5c-92464cfb4ed8\|625571b7-aa66-4f98-ac5c-92464cfb4ed8]] ([[User talk:625571b7-aa66-4f98-ac5c-92464cfb4ed8\|talk]]) 14:28, 14 March 2017 (UTC)
		+
		+	Doesn't Randall mention three different strategies? The comic says two, however.

← Older revision		Revision as of 14:28, 14 March 2017
Line 9:		Line 9:

	Candy button paper was around long before 1980. I remember it from the 1950s. [[Special:Contributions/108.162.241.123\|108.162.241.123]] 17:59, 2 October 2016 (UTC)		Candy button paper was around long before 1980. I remember it from the 1950s. [[Special:Contributions/108.162.241.123\|108.162.241.123]] 17:59, 2 October 2016 (UTC)
		+
		+	If candy buttons were two-sided, I would make it into a Möbius strip. [[User:625571b7-aa66-4f98-ac5c-92464cfb4ed8\|625571b7-aa66-4f98-ac5c-92464cfb4ed8]] ([[User talk:625571b7-aa66-4f98-ac5c-92464cfb4ed8\|talk]]) 14:28, 14 March 2017 (UTC)

← Older revision		Revision as of 19:56, 2 October 2016
Line 1:		Line 1:
−	Candy button paper was around long before 1980. I remember it from the 1950s.	+	It is possible to run a Turing machine on a candy belt:
−	[[Special:Contributions/108.162.241.123\|108.162.241.123]] 17:59, 2 October 2016 (UTC)	+
		+	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 [[Special:Contributions/69.163.36.90\|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 [[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? {{unsigned ip\|108.162.245.151}}
		+
		+	Candy button paper was around long before 1980. I remember it from the 1950s. [[Special:Contributions/108.162.241.123\|108.162.241.123]] 17:59, 2 October 2016 (UTC)

← Older revision		Revision as of 17:59, 2 October 2016
Line 1:		Line 1:
−	~~It is possible to run a Turing machine on a candy belt:~~	+	Candy button paper was around long before 1980. I remember it from the 1950s.
−		+	[[Special:Contributions/108.162.241.123\|108.162.241.123]] 17:59, 2 October 2016 (UTC)
−	~~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 [[Special:Contributions/69.163.~~36.90\|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 [[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? {{unsigned ip\|108.162.245.151}}~~