 Turing's proof is one of the first cases of decision problems to be concluded.The theoretical conclusion that it is not solvable is significant to practical computing efforts, defining a class of applications which no programming invention can possibly perform perfectly.Jack Copeland (2004) attributes the introduction of the term "halting problem" to the work of Martin Davis in the 1950s.