Timeline for A question about imaginary Turing machines.
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 11, 2011 at 18:40 | vote | accept | Garabed Gulbenkian | ||
| Feb 9, 2011 at 23:35 | answer | added | Jason | timeline score: 3 | |
| Feb 9, 2011 at 15:51 | comment | added | Garabed Gulbenkian | Thanks for your comments and suggestions. I amsure that the actual program. I am sure that the actual program for T, if one thinks of it as a sequence of ordered quintuples, will be tremendously long. I am really interested in an upper bound on the length of this sequence-if such a bound has ever been worked out. Perhaps the bound is too large to ever be worked out. I am not sure what effect (if any) the use of a Universal Turing machine would have on the size of this upper bound. | |
| Feb 8, 2011 at 3:46 | comment | added | drbobmeister | In fact, the TM can be set up so that the first thing it does is print the program on the blank tape, then transfer control to the UTM. So Garabed's case includes Gerhard's. | |
| Feb 7, 2011 at 21:19 | comment | added | Gerhard Paseman | If you were allowed a finite starting configuration on the tape, you could use a universal Turing machine and the appropriate program. You could then run an Internet contest to see who could come up with the shortest binary program to feed to the machine that accomplishes what you wanted. Gerhard "Ask Me About System Design" Paseman, 2011.02.07 | |
| Feb 7, 2011 at 18:31 | history | asked | Garabed Gulbenkian | CC BY-SA 2.5 |