in Theory of Computation
628 views
2 votes
2 votes
Given a TM, M accepts 100 strings. Is it decidable, semi decidable or fully undecidable??
in Theory of Computation
by
628 views

4 Comments

thnk u, what if it would be M accepts exactly 100 strings- it should be totally undecidable, am i correct?
0
0
@Vegeta Yes.
0
0
edited by
Why..M accepts exactly 100 strings is undecidable, not even semi decidable??
0
0

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??

by

Related questions