Green function | Graph of a function | Hash function | Schur function | Riemann zeta function | Dirac delta function | Bessel function | Monotonic function | Lateralization of brain function | function (mathematics) | Cryptographic hash function | Partial Nuclear Test Ban Treaty | Linear function | hash function | Gaussian function | function | Euler's totient function | Domain of unknown function | continuous function | Wave function | Quadratic function | Meijer G-function | Massieu function | Lyapunov function | Lambert W function | Gamma function | Function block diagram | Feigenbaum function | Continuous function | Computable function |
However, the reader needs to be cautioned that, even though the μ operator is easily created by the base instruction set doesn't mean that an arbitrary partial recursive function can be easily created with a base model -- Turing equivalence and partial recursive functions imply an unbounded μ operator, one that can scurry to the ends of the register chain ad infinitum searching for its goal.