If all programming languages are Turing Complete then why do we have language wars?

Posted by kadaj on Programmers See other posts from Programmers or by kadaj
Published on 2012-11-30T04:16:05Z Indexed on 2012/11/30 5:25 UTC
Read the original article Hit count: 251

Filed under:

programming-languages

|

turing-completeness

There are language wars saying one programming language is better than other.. Consider Lisp and Java; and we can argue that the meta programming capabilities of Lisp is better than that of Java. But that does not mean Java cannot have meta programming capabilities without being another dialect of Lisp.
Basically all programming languages are Turing Complete. So doesn't that mean we could solve any solvable problem in all those programming languages?

© Programmers or respective owner

Related posts about programming-languages

Which order would you teach programming languages in, when teaching a newbie?

as seen on Programmers - Search for 'Programmers'
If you had to design a study program, with a breadth-of-programming-languages requirement, which stated that the student should be exposed to all major concepts and methodologies that can be taught through (at the minimum) 6 programming languages, which programming languages would you choose to teach… >>> More
Extending Programming Languages

as seen on Stack Overflow - Search for 'Stack Overflow'
(Since I just posted this in another question, but my browser had to be annoying and submit it without content first, here it is again:) I'm a fan of clean code. I like my languages to be able to express what I'm trying to do, but I like the syntax to mirror that too. For example, I work on a lot… >>> More
Facebook Game Development - Which Programming languages?

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi folks, I am going to develop a facebook game as topic for my thesis. I am wondering which programming languages i should choice. I am used to programming in .NET. But i am also comfortable in C++ and Java. I don't want to use Flash as the graphical frontend since i don't like it. So i guess… >>> More
Objective-measures of the power of programming languages

as seen on Stack Overflow - Search for 'Stack Overflow'
Are there any objective measures for measuring the power of programming languages? Turing-completeness is one, but it is not particularly discriminating. I also remember there being a few others measures of power which are more limited versions (like finite-state-autonoma), but is there any objective… >>> More
Extending Programming Languages [closed]

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm a fan of clean code. >>> More

Related posts about turing-completeness

Programming Language, Turing Completeness and Turing Machine

as seen on Programmers - Search for 'Programmers'
A programming language is said to be Turing Completeness if it can successfully simulate a universal TM. Let's take functional programming language for example. In functional programming, function has highest priority over anything. You can pass functions around like any primitives or objects. This… >>> More
Are non Turing-complete languages considered programming languages at all?

as seen on Programmers - Search for 'Programmers'
Reading a recent question: Is it actually possible to have a 'useful' programming language that isn't Turing complete?, I've come to wonder if non Turing-complete programming languages are considered programming languages at all. Since Turing-completeness means a language has to have variables to… >>> More
If all programming languages are Turing Complete then why do we have language wars?

as seen on Programmers - Search for 'Programmers'
There are language wars saying one programming language is better than other.. Consider Lisp and Java; and we can argue that the meta programming capabilities of Lisp is better than that of Java. But that does not mean Java cannot have meta programming capabilities without being another dialect of… >>> More
how useful is Turing completeness? are neural nets turing complete?

as seen on Stack Overflow - Search for 'Stack Overflow'
While reading some papers about the Turing completeness of recurrent neural nets (for example: Turing computability with neural nets, Hava T. Siegelmann and Eduardo D. Sontag, 1991), I got the feeling that the proof which was given there was not really that practical. For example the referenced paper… >>> More
What are practical guidelines for evaluating a language's "Turing Completeness"?

as seen on Stack Overflow - Search for 'Stack Overflow'
I've read "what-is-turing-complete" and the wikipedia page, but I'm less interested in a formal proof than in the practical implications of being Turing Complete. What I'm actually trying to decide is if the toy language I've just designed could be used as a general-purpose language. I know I can… >>> More