Question:medium

Given a TM \(M\), a state \(q\), and input \(w\), determine whether computation of \(M\) on \(w\) ever visits state \(q\).

Show Hint

If YES instances can be recognized but NO instances may loop forever, the problem is recursively enumerable (partially decidable).

Updated On: Jun 25, 2026

Problem is decidable
Problem is undecidable but partially decidable
Problem is undecidable and not even partially decidable
Problem is not a decision problem

Show Solution

The Correct Option is B

Solution and Explanation

Was this answer helpful?

0

Top Questions on Theory of Computations

Questions Asked in TS PGECET exam

The Eigenvalues of \(3\times 3\) real matrix A are 1, 2, 3 then \(A^{-1} =\)

TS PGECET - 2026
Linear Algebra

Let \(A=\begin{bmatrix} 1 & 1 & 0 \\ 0 & 1 & 1 \\ 0 & 0 & 1 \end{bmatrix}\). If \(u_1\) and \(u_2\) are column matrices such that \(Au_1 = \begin{bmatrix} 2 \\ 1 \\ 0 \end{bmatrix}\) and \(Au_2 = \begin{bmatrix} 1 \\ 0 \\ 1 \end{bmatrix}\), then \(u_1 - u_2\) is

TS PGECET - 2026
Matrices

Let \(a,b\) and \(c\) be real numbers. Suppose there exist real numbers \(x,y,z\) which are not all zero such that the system of equations \(x = cy + bz\), \(y = cx + az\) and \(z = bx + ay\) has a non-zero solution then \(\left(a+b+c\right)^2 =\)

TS PGECET - 2026
Determinants

For the function \(f(x)=\log x\), the number \(c\) strictly between \(e^2\) and \(e^3\) that satisfies \(f'(c)=\dfrac{f(e^3)-f(e^2)}{e^3-e^2}\) is

TS PGECET - 2026
Calculus