![]() Java, JavaScript, Perl, etc.) are all Turing complete because they each implement all the features required to run programs like addition, multiplication, if-else condition, return statements, ways to store/retrieve/erase data and so on. On the other hand, if it can run any program that the universal Turing machine can run, then it's Turing complete. This would make it "Turing incomplete" (so to speak). But now imagine that for some reason your programming language can't perform the same addition. A Turing machine can easily run this program. Now, a programing language is called "Turing complete", if it can run any program (irrespective of the language) that a Turing machine can run given enough time and memory.įor example: Let's say there is a program that takes 10 numbers and adds them. ![]() Programming languages are similar to those machines (although virtual). ![]() So he created "Universal Turing Machine" that can take ANY program and run it. But then he had to create different machines for different programs. Alan Turing created a machine that can take a program, run that program, and show some result. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |