 A set \(A \subseteq \mathbb{N}\) is said to be computable (or recursive according to the older terminology of  Section 2)  just in case its characteristic function is. More generally we have the following: