Home computickets fullness of Turing

fullness of Turing




As you know, most of the well-used programming languages ​​(especially imperative) are complete by Turing. And some – even relative to the compilation time, as, say, C++ with their templates.

And how is it proved / disproved fullness of Turing? In itself, this concept looks difficult to formalizable.

Answer 1, Authority 100%

Answer 2, Authority 25%

for some reason it seems to me that if we can realize a Turing machine on some kind of language, it means that he is turing-full. Although I can make mistake.

Programmers, Start Your Engines!

Why spend time searching for the correct question and then entering your answer when you can find it in a second? That's what CompuTicket is all about! Here you'll find thousands of questions and answers from hundreds of computer languages.

Recent questions