Register

gatequestions

517 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · peter linzNext → · #SQL #TestBook
← Previous in category · peter linzNext in category → · Rice Theorem
Position:
Show:

Related questions

0 0 votes
1 1 answer
74
74 views
GO Classes asked 5 days ago
74 views
GO Classes DPP | GATE CS | Theory of Computation | Turing Machine
Consider, $A_{\mathrm{TM}}=\{\langle M,w\rangle\mid M\ \mathrm{is\ a\ TM\ and}\ M\ \mathrm{accepts}\ w\}$Mark all properties that are certainly true for the stated langua...
1 1 vote
1 1 answer
90
90 views
GO Classes asked Sep 30
90 views
GO Classes DPP | GATE CS | Theory of Computation | Decidability
Which of the following languages are recognizable?$\{\langle M\rangle\mid M\ \mathrm{is\ a\ TM\ and}\ L(M)\ \mathrm{is\ finite}\}$ $\{\langle M_1,M_2,w\rangle\mid M_1\ \m...
0 0 votes
1 1 answer
73
73 views
GO Classes asked Sep 30
73 views
GO Classes DPP | GATE CS | Theory of Computation | Decidability
Define, $A_{\mathrm{TM}}=\{\langle M,w\rangle\mid M\ \mathrm{is\ a\ TM\ and}\ w\in L(M)\}$.Consider the TM $N$:On input $\langle M,w\rangle$:Simulate $M$ on $w$. If $M$ a...
0 0 votes
1 1 answer
64
64 views
GO Classes asked Sep 30
64 views
GO Classes DPP | GATE CS | Theory of Computation | Decidability
Which of these statements are true for all choices of TM $M$, string $w$, and language $L$?If $M$ decides $L$ and $M$ rejects $w$, then $w\notin L$. If $M$ decides $L$ an...