ABSTRACT
The concept of computability emerged in mathematics from the concept of proof. Around 1900, difficulties in the foundations of mathematics led to the demand for a formal concept of proof, in which theorems are derived from axioms by completely explicit rules of inference. The rules are supposed to operate on strings of symbols without the need for conscious intervention, so a formal system is a process for proving theorems by computation.
