Register

TOC TM
closed

• closed by
297 views
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
2
Mk Utkarsh asked Sep 15, 2018
1,530 views
TM that accepts input string x
$D = \left \{ M \mid \ M \text{ is a TM that accepts the input string } x \right \}$ What is complement of D and is it Decidable, Turing recognizable or not Turing recognizable?
$D = \left \{ M \mid \ M \text{ is a TM that accepts the input string } x \right \}$What is complement of D and is it Decidable, Turing recognizable or not Turing recogni...
User Avatar
11 votes
11 votes
2 answers
3
sourav. asked Sep 9, 2017
4,552 views
$\{\langle M \rangle \mid M$ is a TM and there exist an input whose length is less than 100, on which $M$ halts$\}$
My Question $\{\langle M \rangle \mid M$ is a TM and there exist an input whose length is less than 100, on which $M$ halts$\}$I have to check that it is Turing Recogniza...
User Avatar
1 votes
1 votes
1 answer
4
Xylene asked Jul 15, 2017
1,097 views
Proof of whether a TM accepts epsilon is semi decidable
From rice theorem, I know that it is not recursive. But can someone prove that ? Or atleast give some intuitive proof?
From rice theorem, I know that it is not recursive. But can someone prove that ? Or atleast give some intuitive proof?
User Avatar
Link Copied!