A few days ago I returned to Twitter and well, apparently things have not changed much… I came across a Byzantine discussion that I thought we might have gotten over, Is HTML a programming language? (Yes, these things are still discussed)…
There are two ways to answer this question:
- Going straight to the definition:
- Turing completeness:
In computability theory, a Turing complete system is a system that can perform any computation that can be described in a formal language, given enough time and memory. The concept of a Turing complete system is named after the mathematician Alan Turing, who proposed the concept of a theoretical machine, called a Turing machine, that could perform any calculation that could be described in a formal language.
Now, another question may arise after this explanation, so, are all programming languages Turing complete?
Most modern programming languages are considered to be Turing complete. However, some programming languages are not considered to be Turing complete. These are often specialized languages that are designed for a specific purpose and are not intended to be used for general-purpose programming.
I hope this explanation helps you…
About Andrés Bedoya
Learn more about Andrés Bedoya