>RE is a WAY bigger class than what the verifier can compute alone I always think of the RE(CE) sets as those that are possible to compute. I’m aware that RE s

>RE is a WAY bigger class than what the verifier can compute alone I always think of the RE(CE) sets as those that are possible to compute. I’m aware that RE sets are not computable, but since RE sets are those accepted by a turing machine, I still consider that set to be the “main” one when speaking informally. Maybe this is misguided