Let two machines be P and Q. The state in which P can simulate Q and Q can simulate P is called:
Posted: Thu Jul 14, 2022 9:26 am
a) Turing Equivalence
b) State Equivalence
c) Universal Turing Machine
d) None of the mentioned
b) State Equivalence
c) Universal Turing Machine
d) None of the mentioned