-
@stmanfr No. With a TM clock program like your FSM clock program, you can't run nor all FSM nor all TM. But with a general machine able to run any TM, you can run any FSM, but with a general machine able to run all FSM, you can't run some TM…Permalink On twitter.com
Mood +1 🙂
-
@stmanfr And so any FSM is translatable/modelisable as a TM. But the opposite not. So the set of all FSM is included on the set of all TM. There is nothing a FSM can do but not a TM. But the opposite yes.Permalink On twitter.com
Mood +1 🙂
-
@stmanfr Good example is langage recognition. FSM can process all regular grammar and any regular grammar is modelisable with a FSM. But LBA grammar is not possible on FSM but on a TM yes.Permalink On twitter.com
Mood +6 🙂
-
@stmanfr And again, it's another example than any FSM is translatable to a TM, but some TM is not translatable to FSM. You can do some things with TM you can't do with FSM. You can do whatever FSM able to do with a TM.On twitter.com
Mood 0