Is there a set $B$ about which it provably cannot be decided whether it is [computable](https://en.wikipedia.org/wiki/Recursive_set) in $\mathsf{ZFC}$?



Meta-incomputability
An explicit example: $B=$ the set of all theorems of ZFC.


