The turing-completeness tag has no wiki summary.
-1
votes
3answers
411 views
If all programming languages are Turing Complete then why do we have language wars? [closed]
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 ...
6
votes
1answer
372 views
Are non Turing-complete languages considered programming languages at all?
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 ...
20
votes
5answers
1k views
Is it actually possible to have a 'useful' programming language that isn't Turing complete?
Where it is accepted that a language has to be Turing complete to be any good, is it actually possible to have a 'useful' programming language that isn't Turing complete?
I should clarify that this ...
1
vote
2answers
177 views
Can the Turing machine be classified?
Can the Turing machine be classified e.g. as a Mealy machine? Why not? Can a Turing machine be input to another Turing machine without complication like halting problems?
Thanks
1
vote
2answers
383 views
Programming Language, Turing Completeness and Turing Machine
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 ...
6
votes
2answers
211 views
Quantum computers and Turing Machine
As far as I know, a Turing Machine is the widely used model in computational theory to know whether something could be computed and if computed can they can be computed in finite time (P, NP, ...
1
vote
2answers
268 views
What are complete programming languages with a minimal syntax and how is that important? [closed]
With minimal syntax I mean a language that could be entirely described with the least words possible, but complete enough to make any kind of program.
45
votes
7answers
2k views
Is musical notation Turing-Complete?
I'm wondering, is music notation language Turing-Complete?
My first thought is that there are loops in musical notation, but there is no way to write conditional branches, right?
I'm not a ...
11
votes
3answers
1k views
What makes a language Turing-complete?
What is the minimal set of language features/structures that make it Turing-complete?
13
votes
4answers
514 views
Measure of power other than Turing completeness
I originally tried asking this on StackOverflow, but it was too subjective :-(. I am interested in methods of defining the power of programming languages. Turing completeness is one, but it is almost ...
