In mathematical logic and computer science, a general recursive function, partial recursive function, or u-recursive function is a partial function from natural numbers to natural numbers that is "computable" in an intuitive sense - as well as in a formal one. If the function is total,