A PDA $P$:$=(Q,,T,,q0,Z0,F)$

Select one:

True

False

If $(q,a,x)=\{(p,A)\}$ is a transition, then the following is True or False

$(q,aw,xB)|--(p,w,AB)$

Select one:

True

False

Turing Machines are very powerful $($abstract$)$ machines that could simulate any modern day computer $($although very, very slowly!$)$

Select one:

True

False

If a problem cannot be "solved" even using a Turing Machine, then it implies that the problem is undecidable.

Select one:

True

False

One move $($denoted by $|---)$ in a TM does the following:

$(q,x)=(p,Y,D)$