(computing theory) Capable of computing any recursive function.

(calculus) A function f : X→R (where X is a subset of R, possibly a discrete set) that either never decreases or never increases as its independent variable increases; that is, either x ≤ y implies f(x) ≤ f(y) or x ≤ y implies f(y) ≤ f(x).

(mathematics) A function that either never decreases or never increases as its independent variable increases.

plural of functional group

(mathematics) A function from the real line to a finite subset of the real line.

(mathematics) A function to be maximized or minimized in optimization theory.

(biochemistry, genetics) A genomics branch that measures expression levels of RNAs and proteins to understand biological functions of a set of genes in cells.

(game theory) A mathematical function that assigns a real number to every element of the outcome space in a way that captures the agent's preferences over both simple and compound lotteries.

(game theory) A mathematical function describing the award given to a single player at the outcome of a game.

(mathematics) A function which, when applied a given number of times, equals another given function.