Timeline for reversible Turing machines
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 11, 2010 at 12:31 | vote | accept | Łukasz Grabowski | ||
| May 11, 2010 at 12:31 | |||||
| May 10, 2010 at 19:47 | comment | added | Łukasz Grabowski | Sorry, it should be "I consider {0,1}^Z..." | |
| May 10, 2010 at 19:46 | vote | accept | Łukasz Grabowski | ||
| May 10, 2010 at 19:46 | |||||
| May 10, 2010 at 19:46 | comment | added | Łukasz Grabowski | As to the position, I consider $\\{0,1\\}^Z$ to mean the set of functions from Z (i.e. integers) to {0,1}, so the position is automatically encoded. Unfortunately this paper gives an answer which is a Turing machine with more than one tape, which does not satisfy me. S should be a standard one-tape Turing machine. | |
| May 10, 2010 at 12:19 | comment | added | Antonio E. Porreca | By the way, if I recall correctly, Bennet’s construction is very similar to what Joel David Hamkins suggests in his answer. | |
| May 10, 2010 at 12:04 | history | answered | Antonio E. Porreca | CC BY-SA 2.5 |