Timeline for Variant of Turing machine
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 18, 2016 at 17:03 | comment | added | skankhunt42 | Part 1 is trivial because every standard Turing machine is also a modified Turing machine (argue why!). For part 2, it might help if you write down the formal definition of acceptance of a modified Turing machine and try to work from there (i.e. how to convert it so that you get the standard acceptance condition and then show that the two Turing machines accept the same language). | |
| Nov 18, 2016 at 16:37 | comment | added | sumo | Hey thanks for the info, but i know the steps involved. I'm not able to prove how L(T1)=L(T2) and L(T3)=L(T4). | |
| Nov 18, 2016 at 11:28 | history | answered | Yuval Filmus | CC BY-SA 3.0 |