COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
finite memory tape
|
|
|
infinite memory tape
|
|
|
depends on the algorithm
|
|
|
none of the mentioned
|
Detailed explanation-1: -The turing machine operates on an infinite memory tape divided into cells. The machine positions its head over the cell and reads the symbol.
Detailed explanation-2: -Explanation: The turing machine operates on an infinite memory tape divided into cells.
Detailed explanation-3: -The machine operates on an infinite memory tape divided into discrete cells, each of which can hold a single symbol drawn from a finite set of symbols called the alphabet of the machine.
Detailed explanation-4: -A two-way infinite tape Turing machine (TTM) is a Turing machine with its input tape infinite in both directions, the other components being the same as that of the basic model. We see in the following theorem that the power of TTM is no way superior of that of the basic TM.