compiler construction - Can a language be turing complete but incomplete in other ways? -
For example, when writing an operating system, there are some things that can not be completed in the whole language?
No or at least if you found something that would be against it.
However, there are languages that Turing has completed but there is a complete pain in the ass for writing some programs, i.e. processing in string fortran, numerical programming in cobol, integer arithmetic in CAD, practical As a matter of fact, everything in x86 codel.
And then there's definitely there.
Comments
Post a Comment