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.
which can be computed by a theoretical model of a computer, in a finite amount of time
whose characteristic function is recursive (4)
of an expression, each term of which is determined by applying a formula to preceding terms
drawing upon itself, referring back.
of a program or function that calls itself