The definition in terms of μ-recursive functions as well as a different definition of "rekursiv" functions by Gödel led to the traditional name "recursive" for sets and functions computable by a Turing machine. The word "decidable" stems from the German word "Entscheidungsproblem" which was used in the original papers of Turing and others. In contemporary use, the term "computable function" has various definitions: according to Cutland (1980), it is a partial recursive function (which can be undefined for some inputs), while according to Soare (1987) it is a total recursive (equivalently, general recursive) function. This article follows the second of these conventions. Soare (1996) gives additional comments about the terminology.