I was wondering if it was possible to create a TM that semi-decides (but doesn't decide) either of the following two languages:
I assume for 2, a one-state TM that just automatically accepts would be fine? I don't think it's possible for any input not to halt, or be rejected, so technically the TM would just semi-decide?
However, for 1, I'm not 100% sure what that TM would look like. Would I just have to figure out a way to have at least one input (or, more simply, all inputs), not halt, since none could possibly accept?
Edit: I know such TMs must exist, I'm more so confused as to what they look like.