Re:Subtleties of the ANSI/ISO C standard [pdf]
by dbpokorny on Tuesday December 22, 2015 @11:50PM
(#10782023)
When you say "C" and "Turing machine" in the same sentence, you should immediately think of how you would go about explaining a proof of, say, the fact that a one tape TM can simulate a k tape TM using C. C is just one of many languages in which you can express the state transition diagram of a TM.
[ Parent
| on HN ]
Re:Subtleties of the ANSI/ISO C standard [pdf]
by knz42 on Thursday December 24, 2015 @05:50AM
(#10787778)
The point being you can't, due to the finiteness of c's abstract memory model, both for the heap (the tape) and stack (state transition graph)
Re:Subtleties of the ANSI/ISO C standard [pdf]
by dbpokorny on Friday December 25, 2015 @05:45PM
(#10792605)
No, any undergraduate CS major at a top 5 university should be able to do this. It's possible to do this for any programming language. If you need help then it's on p. 161 Theorem 7.2 of Hopcroft and Ullman (1979).