1. {<M,w>| M is a TM, and w is a string, and there exist a TM, M' such that w (does not belongs to) L(M) Intersection L(M')}
2. {<M>| M is a TM, and M is the only TM that accepts L(M) = { } = empty set}
I think this problem is decidable as we can construct another TM which have different encoding compares to given TM, which also accepts {} = empty set.
Ryt??
3. {<M> | M is a TM, and |M| < 100}
here, does |M| < 100 means we are talking about binary encoding of the TM, whose decimal value must be less than 100.
Binary Encoding:- 0no of states10no of input symbol10no of tape symbol1... like this other information.
Ryt??