|
Please sign your posts with ~~~~
|
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
| Latest revision |
Your text |
| 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.
| |
| − |
| |
| − | : 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. -- 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)
| |
| − |
| |
| − | 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)
| |
