A unary function is a function that takes one argument. In
Many of the
ee also
*
*
*
*
References
* [http://www.cs.ucl.ac.uk/staff/W.Langdon/FOGP Foundations of Genetic Programming]
Wikimedia Foundation. 2010.
Unary numeral system — The unary numeral system is the bijective base 1 numeral system. It is the simplest numeral system to represent natural numbers: in order to represent a number N , an arbitrarily chosen symbol representing 1 is repeated N times. For example,… … Wikipedia
Unary operation — In mathematics, a unary operation is an operation with only one operand, i.e. a single input. Specifically, it is a function where A is a set. In this case f is called a unary operation on A. Common notations are prefix notation (e.g. +, −, not) … Wikipedia
Function object — A function object, also called a functor or functional, is a computer programming construct allowing an object to be invoked or called as if it were an ordinary function, usually with the same syntax.Function objects are unrelated to functors in… … Wikipedia
unary — 1. adjective a) Consisting of or involving a single element or component. Negation is a unary operation. b) Of an operation, function, procedure or logic g … Wiktionary
unary — /yooh neuh ree/, adj. Math. pertaining to a function whose domain is a given set and whose range is contained in that set. [1570 80; < L un(us) one + ARY, on the model of BINARY] * * * … Universalium
unary — adj. of a mathematical function whose domain is a given set and whose range falls within the set … English contemporary dictionary
additive function — noun A unary function that preserves the addition operation; a unary function f such that for any x and y: f(x + y) = f(x) + f(y) … Wiktionary
Argument of a function — In mathematics, an argument of a function is a specific input in the function, also known as an independent variable. When it is clear from the context which argument is meant, the argument is often denoted by arg. A mathematical function has one … Wikipedia
Tarski's exponential function problem — In model theory, Tarski s exponential function problem asks whether the usual theory of the real numbers together with the exponential function is decidable. Tarski had previously shown that the theory of the real numbers (without the exponential … Wikipedia
Primitive recursive function — The primitive recursive functions are defined using primitive recursion and composition as central operations and are a strict subset of the recursive functions (recursive functions are also known as computable functions). The term was coined by… … Wikipedia
