always halts with a Boolean-style output that determines whether I ∈ N_π or not

loops or halts depending on whether the output is True or not

can be represented with a Moore machine

is TC

ends in a non-accepting state if the problem is unsolvable