Let two machines be P and Q. The state in which P can simulate Q and Q – McqOptions

MCQOPTIONS

1.	Let two machines be P and Q. The state in which P can simulate Q and Q can simulate P is called:
A.	Turing Equivalence
B.	State Equivalence
C.	Universal Turing Machine
D.	None of the mentioned
Answer» B. State Equivalence

Discussion

No Comment Found

Related MCQs

Which of the following a Non-turing Complete language?
Which of the games fill under the category of Turing-complete?
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.
Which of the following remarks the given statement?Statement: Any function whose values can be computed by an algorithm, can be computed by a Turing machine.
Fill in the blank with an appropriate option.In automata theory, ___________ is said to be Computationally Universal if can be used to simulate any single taped Turing Machine.
WHICH_OF_THE_GAMES_FILL_UNDER_THE_CATEGORY_OF_TURING-COMPLETE??$
Which among are not the results of computational theory?
Which of the following can lack in a Universal computer?
Which of the following can be used to simulate any turing machine?
Which of the following remarks the given statement?