|Turing machine (Re: Help on disassembler/decompilers) email@example.com (1990-09-18)|
|From:||firstname.lastname@example.org (Dave Jones)|
|Organization:||Megatest Corporation, San Jose, Ca|
|Date:||18 Sep 90 22:03:15 GMT|
>From article <1990Sep14.email@example.com>, by firstname.lastname@example.org (Charles Bryant):
> In article <email@example.com> firstname.lastname@example.org (R. Kym Horsell) writes:
>> ... You can't even
>>say that "assembly language is closer to the machine & you can do things in
>>it that you can't in HLLs" -- after all, assembly and HLL are both capable
>>of emulating Turning machines, right?
> Well how would you translate this C function into Pascal.
> [ code omited. ]
Obviously, you would run your C-to-Turing-machine translator over it,
producing some Pascal initialization statements for your Turing machine
emulator that you wrote in Pascal. What could be simpler? :-)
Truth is, not only is it not the case that all computer systems are
effectively Turing machines, none of them is! It's those damn finite
tapes, for one thing. And computers are always hooked up to input/output
devices. (A computer is something that controls and monitors machinery.)
But discounting all that, don't we care just a little bit about how long
Return to the
Search the comp.compilers archives again.