A μ-recursive function is a type of mathematical function (as opposed to a function in computer programming). A μ-recursive function can be written using certain mathematical operations, such as addition, multiplication, and a special kind of operation called recursion. Recursion means that the function is defined in terms of itself, like this: if someone asks you for the definition of a μ-recursive function, you would first say "A μ-recursive function is a function that is defined in terms of itself". So the definition of a μ-recursive function is recursive. All μ-recursive functions can be written using just a few of the simplest mathematical operations, and this makes them very useful for studying mathematics.