611 views
2 votes
2 votes
Given a TM, M accepts 100 strings. Is it decidable, semi decidable or fully undecidable??

1 Answer

0 votes
0 votes

What if the problem is like,

Given a TM, M accepts a set of 100 strings.

Is it decidable, semidecidable or partially decidable??

Related questions

1 votes
1 votes
2 answers
4
Parshu gate asked Nov 29, 2017
829 views
Suppose in question we are given the language is Turing Recognizable , can I consider it a CFL or Regular?