The Gateway to Computer Science Excellence

Michael Sipser Edition 3 Exercise 5 Question 13 (Page No. 239)

0 votes
12 views
A useless state in a Turing machine is one that is never entered on any input string. Consider the problem of determining whether a Turing machine has any useless states. Formulate this problem as a language and show that it is undecidable.
in Theory of Computation by Veteran (60.8k points) | 12 views

Please log in or register to answer this question.

← Prev. Qn. in Sub. Next Qn. in Sub. →
← Prev. Next →

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,834 questions
57,852 answers
199,512 comments
108,375 users