Computability

A mathematical property of problems: a problem is "computable" if it can be solved by a Turing Machine (i.e. by a finite set of rules operating on symbols). Turing proved that some problems are not computable — they cannot be solved by any mechanical procedure.