Question

State true or false:

Statement: Inorder to show something is Turing complete, it is enough to demonstrate that it can be used to simulate some Turing complete system.

(a) Statement: Inorder to show something is Turing complete, it is enough to demonstrate that it can be used to simulate some Turing complete system.

(b) true

(c) false

I have been asked this question in an international level competition.

This interesting question is from Simulation of Turing Machine in section Introduction to Turing Machines of Automata Theory

Answer 1

The correct option is (a) Statement: Inorder to show something is Turing complete, it is enough to demonstrate that it can be used to simulate some Turing complete system.

The best I can explain: Yes it is. For instance, an imperative language is called Turing complete if it tends to have conditional branching and an ability to maintain an arbitrary number of symbols.