word looked up :

How to specify a function

In mathematics, functions can be specified in several ways. In practice, most functions that relate (combinations of) numbers with numbers are specified by one or more equation. For example, the dist function can be specified with

dist(x,y) := (x² + y²)^1/2

z := (x² + y²)^1/2,

where z is called the dependent variable and x and y are called the independent variables. This type of specification is sometimes called specification by intension. A function defined in this way is called an explicit function, as it is a function being stated explicitly.

Another way of specifying functions is by specifying the the set of ordered pairs that form the function's graph by either enumerating it or specifying it in set theory. The wght function, for example, might be specified by

wght := {(Larry,160), (Jimmy,165), (Ruth,125), (Cindy,120), ...}

and nlog might be specified by

nlog := {(x,y) ∈ R × R : x = e^y}.

This type of specification is sometimes also called specification by extension. A function defined in this way is called an implicit function, as its definition is stated implicitly.

Another example of specification by extension is, given a function φ on two variables, we may define a function f by

f={(x,y) : f((x,y))=0}.

Note that we use the word "may" as it is possibly that f isn't a well-defined function. This is one reason why this type of specification is used. Another reason is that, even we know f is well-defined, we may not present f explicitly in a simple way or the implicit form is more convenient to use.

A third way of specifying functions that is often used in computer science is specification by computation, where it is indicated how the result of the function is computed from the arguments. An example of this are Lambda expressions in Lambda calculus where the function max(a,b) with a and b integers might be specified as

max := λ (a,b) ∈ Z × Z . if a < b then b else a.

Functions may also be specified by recursion. The canonical example is the Fibonacci series[?]; we are given that f(1) = 1, f(2) = 1, and the recurrence that for all n>2, f(n) = f(n-1) + f(n-2). The conclusion of the recurrence theorem is that each recurrence there exists a unique function which satisfies the recurrence and the initial conditions.

059300510215332020059514769688834635758635873555262870152442915204004352689447 334664446419215031092744166006285040305270265565607779696649710945059885870391 822068916320667317801516375713672428257337737167058703831365746011293767915607 582051683622764953493085385640532472801867579731426288215045210608363286881404 392822183586520292198843003066523406386847702510677170402378512648999998186364 019663546192093848378122397071644929110960529236374228006948574083275410544572 091454074942182995270585122909108125175268656820373829630170374905325588751748 538834430353828928769590298201195664852222574135691636221931241961211294659142 880769936890481550353599958758934525910771357972938235475688628093783029074549 552036996838272942530849581942700079024980833429670587156060434506371873413518 400999307606157133410123432603768976194943572624704658767959885492358105473955 266214510087842998936972283699611888552373955586849570866991309009100004009441 356381217556248192307814631780876069820692520513294013025032444664891367078213 287074467043389281531307148819526451038964559181607222479531410021510312773089 653957474396536775431071068604229882322052856041705807552794149099130049805518 517162155215188127617958511786136471046852823760012769179772636086884497439139 705827011032744770584376939069928714051472348211230514965814478463477483496798 499998880010951442766332869757156650678665501934793306340544731602757980070845 471720418307897758519664662486613871767349856541327769911074052450505957241314 131069606626802200127534692284155538325505222039405404511789725391889002990665 .

On wordlookup.net

All is still licensed under the GNU FDL.
It uses material from the wikipedia.

navig stuff