1.

Which of the following is not true about RASP?

A. Binary search can be performed more quickly using RASP than a turing machine
B. Stores its program in memory external to its state machines instructions
C. Has infinite number of distinguishable, unbounded registers
D. Binary search can be performed less quickly using RASP than a turing machine
E. More than two options are incorrect
Answer» E. More than two options are incorrect


Discussion

No Comment Found