Which languages do your think are Turing complete or are close candidates?

Question

Turing complete languages are languages that seek to be universal used to solve any problem with finite time and space. most languages developed over time have been domain specific. so can we really get such languages that solve any problem?

Answer 1

@Eric Blinkidu I'd agree with you and we'd have to remove the limitation of time and space, then we get that most programming languages are Turing complete

Answer 2

there area trade-offs. it's either you would gain in speed and lose space or vice versa but the question is, is it able to solve the problem

Answer 3

All of the major programming languages are Turing complete This includes C, C++, Java, Python, Ruby, etc. A language is Turing complete if it can do anything a Turing machine can do.

Answer 4

No language can exist.

Languages that run faster are always harder to use because they need to be closer to machine code.

Languages that are easier to use and require less development time perform tasks less efficiently. This problem is one of the reasons why some programmers still use assembly.