A programming language is said to be "Turing complete" if it can be used to implement any conceivable algorithm. Which is NOT a Turing-complete language in its standard form?
Reveal answer
Fill a bubble to check yourself
Keep practicing — related questions
- What type of programming language is C?
- What type of programming language is C?
- Which of the following statements is/are FALSE? (1) For every non-deterministic Turing machine, there exist...
- SQL is a set-based, ________________ query language and not an imperative language.
- Which of the following is not a programming language?
- Which kind of language is language C?
- Which of the following is not compiler-based language?
- Every computer program, app and game is written using a programming language. True of false?