Of a countably infinite set, having a computable indicator function.
Capable of being computed, or enumerated.
of a number, able to be approximated to arbitrary precision by a computable function
Of a problem, solvable by a Turing machine or any thereto Turing-equivalent model; Turing-computable.
describing a set for which there exists an algorithm that will determine whether any element is or is not within the set in a finite amount of time.
in intuitionistic logic, a proposition P is decidable in a given theory if it can be proven from the theory that "either P or not P", i.e. in symbols: P∨¬P.
capable of being decided.