AI & ChatGPT searches , social queriess for FUNCTION TREE
Search references for FUNCTION TREE. Phrases containing FUNCTION TREE
See searches and references containing FUNCTION TREE!
Search references for FUNCTION TREE. Phrases containing FUNCTION TREE
See searches and references containing FUNCTION TREE!FUNCTION TREE
Well-quasi-ordering of finite trees
application of the theorem gives the existence of a fast-growing TREE function. TREE(3) is one of the largest simply defined finite numbers, dwarfing
Kruskal's_tree_theorem
In the theory of complex systems, a function tree is a diagram showing the dependencies between the functions of a system. It breaks a problem (or its
Function_tree
Decision support tool
of decision trees is as a descriptive means for calculating conditional probabilities. Decision trees, influence diagrams, utility functions, and other
Decision_tree
Tree in formal language theory
A parse tree or parsing tree (also known as a derivation tree or concrete syntax tree) is an ordered, rooted tree that represents the syntactic structure
Parse_tree
In engineering design, a function–means tree (a.k.a. function/means tree or F/M tree) is a method for functional decomposition and concept generation
Function–means_tree
Fast-growing function
Paris–Harrington theorem Kanamori–McAloon theorem Kruskal's tree theorem, which leads to the similar TREE function Hydra game ^ a Friedman actually writes this as
Friedman's_SSCG_function
Self-balancing binary search tree
a WAVL tree or weak AVL tree is a self-balancing binary search tree. WAVL trees are named after AVL trees, another type of balanced search tree, and are
WAVL_tree
Functions of an angle
mathematics, the trigonometric functions (also called circular functions, angle functions or goniometric functions) are real functions which relate an angle of
Trigonometric_functions
Self-balancing binary search tree data structure
Left-leaning red–black tree AVL tree B-tree (2–3 tree, 2–3–4 tree, B+ tree, B*-tree, UB-tree) Scapegoat tree Splay tree T-tree WAVL tree GNU libavl Cormen
Red–black_tree
Perennial woody plant with elongated trunk
botany, a tree is a perennial plant with an elongated stem, or trunk, usually supporting branches and leaves. In some usages, the definition of a tree may be
Tree
Type of data structure
under each node. Usually, a cryptographic hash function such as SHA-2 is used for the hashing. If the hash tree only needs to protect against unintentional
Merkle_tree
Machine learning technique
gradient-boosted trees model is built in stages, but it generalizes the other methods by allowing optimization of an arbitrary differentiable loss function. The idea
Gradient_boosting
Cryptographic hash function
BLAKE is a cryptographic hash function based on Daniel J. Bernstein's ChaCha stream cipher, but a permuted copy of the input block, XORed with round constants
BLAKE_(hash_function)
Use of functions that call themselves
Wrapper function to handle empty tree bool tree_contains(struct BinaryTree* node, int i) { if (!node) { return false; // empty tree } else { return tree_contains_aux(node
Recursion_(computer_science)
Tree representation of the abstract syntactic structure of source code
abstract syntax tree (AST) is a data structure used in computer science to represent the structure of a program or code snippet. It is a tree representation
Abstract_syntax_tree
Smooth approximation of one-hot arg max
The softmax function, also known as softargmax or normalized exponential function, converts a tuple of K real numbers into a probability distribution
Softmax_function
Data structure
lsb(index) return sum function update(tree, index, value) is while index < size(tree) do tree[index] += value index += lsb(index) The function lsb ( n ) {\displaystyle
Fenwick_tree
Class of algorithms
In computer science, tree traversal (also known as tree search and walking the tree) is a form of graph traversal and refers to the process of visiting
Tree_traversal
Function in a computer game-playing program that evaluates a game position
An evaluation function, also known as a heuristic evaluation function or static evaluation function, is a function used by game-playing computer programs
Evaluation_function
Form of balanced tree
right(L) := T return L else return T end if end function Skew: function split is input: T, a node representing an AA tree that needs to be rebalanced. output: Another
AA_tree
Computer programming function
function from the previous example: instance Functor [] where fmap = map Other examples of Functor instances include trees: -- a simple binary tree data
Map_(higher-order_function)
Continuous function that is not absolutely continuous
In mathematics, the Cantor function is an example of a function that is continuous, but not absolutely continuous. It is a notorious counterexample in
Cantor_function
Stem of woody plants, and main structural component of trees
only support the extensive ecological function of living trees, but also play a large ecological role when the trees eventually die. Dead trunk matter, termed
Trunk_(botany)
Enterprise architecture framework
aspect: Function view: Describes the activities, groupings and hierarchical relationships that exist between them, for example in a function tree. Since
Architecture of Integrated Information Systems
Architecture_of_Integrated_Information_Systems
but implicitly by some recursive splitting-function defined on the hyperrectangles belonging to the tree's nodes. Each inner node's split plane is positioned
Implicit_k-d_tree
Quickly growing function
Ackermann function, named after Wilhelm Ackermann, is one of the simplest and earliest-discovered examples of a total computable function that is not
Ackermann_function
Mapping arbitrary data to fixed-size values
A hash function is any function that can be used to map data of arbitrary size to fixed-size values, though there are some hash functions that support
Hash_function
Dead code elimination technique
to minifiers, tree shaking eliminates unused functions from across the bundle by starting at the entry point and only including functions that may be executed
Tree_shaking
Multivalued function in mathematics
In mathematics, the Lambert W function, also called the omega function or product logarithm, is a multivalued function, namely the branches of the converse
Lambert_W_function
Self-balancing binary search tree
the tree. As a read-only operation the traversal of an AVL tree functions the same way as on any other binary tree. Exploring all n nodes of the tree visits
AVL_tree
Limited form of tree data structure
In computer science, a binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child
Binary_tree
Function returning one of only two values
switching function, used especially in older computer science literature, and truth function (or logical function), used in logic. Boolean functions are the
Boolean_function
Search tree data structure
trie (/ˈtraɪ/, /ˈtriː/ ), also known as a digital tree or prefix tree, is a specialized search tree data structure used to store and retrieve strings
Trie
Self-balancing binary search tree
of weight-balanced trees can be more efficient and highly-parallelizable. Join The function Join is on two weight-balanced trees t1 and t2 and a key
Weight-balanced_tree
Data structure in tree form sorted for fast lookup
a search tree is a tree data structure used for locating specific keys from within a set. In order for a tree to function as a search tree, the key for
Search_tree
Function uniquely mapping two numbers into a single number
mathematics, a pairing function is a process to uniquely encode two natural numbers into a single natural number. Any pairing function can be used in set
Pairing_function
Reason for a change under natural selection; in physiology, what a system does
In evolutionary biology, function is the reason some object or process occurred in a system that evolved through natural selection. That reason is typically
Function_(biology)
Data structure
A B+ tree is an m-ary tree with a variable but often large number of children per node. A B+ tree consists of a root, internal nodes, and leaves. The root
B+_tree
Order-preserving mathematical function
In mathematics, a monotonic function (or monotone function) is a function between ordered sets that preserves or reverses the given order. This concept
Monotonic_function
of the construction tree). In the case of a voxel object (discrete field), it should be converted to a continuous real function, for example, by applying
Function_representation
Hyperparameter optimization framework
objective function), tree-structured parzen estimator (TPE) (i.e., a model-based optimization method that estimates the objective function and selects
Optuna
Method for the construction of fractals
one may visualize the monoid as a full k-ary tree, also known as a Cayley tree. Sometimes each function fi is required to be a linear, or more generally
Iterated_function_system
Species of tree
also known as the maidenhair tree, and often misspelled "gingko" (see Etymology below) is a species of gymnosperm tree native to East Asia. It is the
Ginkgo_biloba
Function with unusual fractal properties
recursive definition closely related to the Stern–Brocot tree. One way to define the question-mark function involves the correspondence between two different
Minkowski's question-mark function
Minkowski's_question-mark_function
Failure analysis system used in safety engineering and reliability engineering
Fault tree analysis (FTA) is a type of failure analysis in which an undesired state of a system is examined. This analysis method is mainly used in safety
Fault_tree_analysis
Tree data structure
the data more efficient. Examples include the M-tree, vp-trees, cover trees, MVP trees, and BK-trees. Most algorithms and data structures for searching
Metric_tree
four balancing schemes. The function join ( t 1 , k , t 2 ) {\displaystyle (t_{1},k,t_{2})} considers rebalancing the tree, and thus depends on the input
Join-based_tree_algorithms
Binary tree of rational numbers
is Stern's diatomic series, and can be computed by the fusc function. The Calkin–Wilf tree is named after Neil Calkin and Herbert Wilf, who considered
Calkin–Wilf_tree
Family of higher-order functions
like various sorts of trees. One writes a function which recursively replaces the constructors of the datatype with provided functions, and any constant values
Fold_(higher-order_function)
Augmented binary search tree
the parent-function p[x], as function Rank(T, x) // Returns the position of x (one-indexed) in the linear sorted list of elements of the tree T r ← size[left[x]]
Order_statistic_tree
Model of computational complexity
corresponds to the linear function x i − x j {\displaystyle x_{i}-x_{j}} . From its definition, linear decision trees can only specify functions f {\displaystyle
Decision_tree_model
Two functions defined from each other
f_tree(tree) In this case the tree function calls the forest function by single recursion, but the forest function calls the tree function by multiple recursion
Mutual_recursion
checksum. Hash function security summary Secure Hash Algorithms NIST hash function competition Key derivation functions (category) "Hash functions". www.azillionmonkeys
List_of_hash_functions
Least-weight tree connecting graph vertices
A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all
Minimum_spanning_tree
Software programming optimization technique
programs. It works by storing the results of expensive calls to pure functions, so that these results can be returned quickly should the same inputs
Memoization
Space partitioning data structure
number of data points. function construct_balltree is input: D, an array of data points. output: B, the root of a constructed ball tree. if a single point
Ball_tree
Effective particle coupling beyond tree level
In quantum electrodynamics, the vertex function describes the coupling between a photon and an electron beyond the leading order of perturbation theory
Vertex_function
Curve whose range contains the unit square
endpoints) is a continuous function whose domain is the unit interval [0, 1]. In the most general form, the range of such a function may lie in an arbitrary
Space-filling_curve
Formal power series
generating function is a representation of an infinite sequence of numbers as the coefficients of a formal power series. Generating functions are often
Generating_function
Set of cryptographic hash functions
additional uses for the function, not (yet) standardized by NIST, including a stream cipher, an authenticated encryption system, a "tree" hashing scheme for
SHA-3
Tree data structure that partitions a 2D area
northEast; QuadTree* southWest; QuadTree* southEast; // Methods function __construct(AABB _boundary) {...} function insert(XY p) {...} function subdivide()
Quadtree
Hash function that is suitable for use in cryptography
hash of a hash list or a hash tree, which allows for additional benefits. One of the main applications of a hash function is to allow the fast look-up
Cryptographic_hash_function
Random search tree data structure
science, the treap and the randomized binary search tree are two closely related forms of binary search tree data structures that maintain a dynamic set of
Treap
Edible fruit
An apple is the round, edible fruit of an apple tree (Malus spp.). Fruit trees of the orchard or domestic apple (Malus domestica), the most widely grown
Apple
Species of flowering tree
drumstick tree (from the long, slender, triangular seed-pods), horseradish tree (from the taste of the roots, which resembles horseradish), ben tree (for its
Moringa_oleifera
Tree data structure
In computer science, M-trees are tree data structures that are similar to R-trees and B-trees. It is constructed using a metric and relies on the triangle
M-tree
Heuristic search algorithm for evaluating game trees
search space. In particular, pure Monte Carlo tree search does not need an explicit evaluation function. Simply implementing the game's mechanics is sufficient
Monte_Carlo_tree_search
Hydra game in mathematical logic
of chopping pieces off a mathematical tree. The hydra game can be used to generate a rapidly growing function, B H ( n ) {\displaystyle BH(n)} , which
Buchholz_hydra
Artificial structure for cats
There are specialized alternatives to the traditional cat tree that offer improved function for cats. These alternative designs include wall-mounted pieces
Cat_tree
Species of flowering plant
name Olea europaea, "European olive") is a species of subtropical evergreen tree in the family Oleaceae. Originating in Asia Minor, it is abundant throughout
Olive
Hardware that translates virtual addresses to physical addresses
problem with this design is poor cache locality caused by the hash function. Tree-based designs avoid this by placing the page table entries for adjacent
Memory_management_unit
Tree-based ensemble machine learning methods
random forest into a minimal "born-again" decision tree that faithfully reproduces the same decision function. Another limitation of random forests is that
Random_forest
Data structure for storing non-overlapping sets
Ackermann function. Although disjoint-set forests do not guarantee this time per operation, each operation rebalances the structure (via tree compression)
Disjoint-set_data_structure
Data structure
radix tree (also radix trie or compact prefix tree or compressed trie) is a data structure that represents a space-optimized trie (prefix tree) in which
Radix_tree
Data type defined by combining other types
Leaf is logically a function Int -> Tree, meaning that giving an integer as an argument to Leaf produces a value of the type Tree. As Node takes two arguments
Algebraic_data_type
Type of balanced binary search tree
as: function size(node) is if node = nil then return 0 else return size(node->left) + size(node->right) + 1 end if end function Even a degenerate tree (linked
Scapegoat_tree
Data structure
attain the worst possible degenerate tree. Inserting the keys in random order often produces a well-balanced tree. function insertion(string key) is node p
Ternary_search_tree
spanning tree of the graph. When the given graph is a complete graph on n vertices, and the edge weights have a continuous distribution function whose derivative
Random_minimum_spanning_tree
Partial order with well-ordered predecessors
functions agree on the domain of f {\displaystyle f} . Then ( T , < ) {\displaystyle (T,<)} is a set-theoretic tree. Its root is the unique function on
Tree_(set_theory)
Type of mathematical function
function is a real-valued function of a real variable, whose graph is composed of straight-line segments. A piecewise linear function is a function defined
Piecewise_linear_function
The Stone–Geary utility function takes the form U = ∏ i ( q i − γ i ) β i {\displaystyle U=\prod _{i}(q_{i}-\gamma _{i})^{\beta _{i}}} where U {\displaystyle
Stone–Geary_utility_function
Computer communications authentication algorithm
type of message authentication code (MAC) involving a cryptographic hash function and a secret cryptographic key. As with any MAC, it may be used to simultaneously
HMAC
Design pattern in pure functional programming
x) (fmap f l) (fmap f r) If we have a binary tree tr :: Tree a and a function f :: a -> b, the function fmap f tr will apply f to every element of tr
Functor (functional programming)
Functor_(functional_programming)
Type of graph in mathematics
contour tree of a real-valued function on a vector space is a polytree that describes the level sets of the function. The nodes of the contour tree are the
Polytree
evasive Boolean function f {\displaystyle f} (of n {\displaystyle n} variables) is a Boolean function for which every decision tree algorithm has running
Evasive_Boolean_function
Cryptographic hash function
In cryptography, Tiger is a cryptographic hash function designed by Ross Anderson and Eli Biham in 1995 for efficiency on 64-bit platforms. The size of
Tiger_(hash_function)
Data structure that maps virtual addresses with physical addresses
problem with this design is poor cache locality caused by the hash function. Tree-based designs avoid this by placing the page table entries for adjacent
Page_table
Minimum spanning forest algorithm that greedily adds edges
to efficiently determine whether two vertices are part of the same tree. function Kruskal(Graph G) is F:= ∅ for each v in G.Vertices do MAKE-SET(v) for
Kruskal's_algorithm
Functional programming construct
creations of these functions can be automated by Haskell's data record syntax. This OCaml example which defines a red–black tree and a function to re-balance
Pattern_matching
Function that takes one or more functions as an input or that outputs a function
collection where the function returned true. fold (including foldl and foldr) scan apply Function composition Integration Callback Tree traversal Montague
Higher-order_function
Species of plant
the leaves, flowers, and wood of a bayur tree can serve a variety of functions. The bark of the bayur tree is grey in color and is considered to be fairly
Pterospermum_acerifolium
Species of tree in the soapberry family
synoecious (hermaphroditic-flowered) tree. It is also called horse-chestnut, European horsechestnut, buckeye, and conker tree. It is not to be confused with
Aesculus_hippocastanum
(similar to the characterization of plane trees by their contour process). Consider a positive excursion of a function. In other words, let e {\displaystyle
Real_tree
Programming function applied recursively to its previous result
a) newtype Tree a = Tree {unNode :: Either a (Tree a, a, Tree a))} anaTree :: (tree_a -> Either a (tree_a, a, tree_a)) -> (tree_a -> Tree a) With these
Anamorphism
English polymath (1642–1727)
Cremona transformations, developed a method for approximating the roots of a function, originated the Newton–Cotes formulas used for numerical integration, and
Isaac_Newton
Machine learning algorithm
any Boolean function e.g. XOR. Trees can be very non-robust. A small change in the training data can result in a large change in the tree and consequently
Decision_tree_learning
Tree in set theory
and no κ-Aronszajn trees exist, then κ is weakly compact. An Aronszajn tree is called special if there is a function f from the tree to the rationals so
Aronszajn_tree
Shapes of fruit tree
against walls or fences, or they can be trained to function as barriers. Some of the following fruit tree forms require training by tying the branches to
Fruit_tree_forms
On short connecting nets with added points
predefined objective function. One well-known variant, which is often used synonymously with the term Steiner tree problem, is the Steiner tree problem in graphs
Steiner_tree_problem
Artificial neural network node function
In artificial neural networks, the activation function of a node is a function that calculates the output of the node based on its individual inputs and
Activation_function
FUNCTION TREE
FUNCTION TREE
Biblical
Look for pages within Wikipedia that link to this title
If a page was recently created here it may not be visible yet because of a delay in updating the database; wait a few minutes or try the function.
Look for pages within Wikipedia that link to this title
Surname or Lastname
Americanized spelling of Swedish Ap(p)elberg, an ornamental name composed of the elements apel ‘apple tree’ + berg ‘mountain’.English
Americanized spelling of Swedish Ap(p)elberg, an ornamental name composed of the elements apel ‘apple tree’ + berg ‘mountain’.English : the surname Applebury is recorded in England in the 19th century, perhaps a habitational name from a lost place.
Girl/Female
Tamil
Ankshika | அஂகà¯à®·à¯€à®•à®¾
It’s derived from the root word - anksh that means a fraction. Ankshika means the fraction of the cosmos
Ankshika | அஂகà¯à®·à¯€à®•à®¾
Boy/Male
Indian
Friction
Boy/Male
Buddhist, Indian, Japanese
Mysterious Function
Girl/Female
Indian
It’s derived from the root word - anksh that means a fraction. Ankshika means the fraction of the cosmos
Surname or Lastname
English
English : topographic name from the plural of Middle English tre(w) ‘tree’.
Surname or Lastname
English
English : topographic name for someone who lived by the gates of a medieval walled town. The Middle English singular gate is from the Old English plural, gatu, of geat ‘gate’ (see Yates). Since medieval gates were normally arranged in pairs, fastened in the center, the Old English plural came to function as a singular, and a new Middle English plural ending in -s was formed. In some cases the name may refer specifically to the Sussex place Eastergate (i.e. ‘eastern gate’), known also as Gates in the 13th and 14th centuries, when surnames were being acquired.Americanized spelling of German Götz (see Goetz).Translated form of French Barrière (see Barriere).In New England, Gates was the preferred English version of the name of an extensive French family, called Barrière dit Langevin.
Surname or Lastname
Cornish
Cornish : habitational name from places so named in the parishes of Zennor and St. Levan, both of which appear earlier in the form Trethyn, from Cornish tre ‘homestead’, ‘settlement’ + dyn ‘fort’.English : variant of Treece, from a form with the weak plural ending.
Surname or Lastname
English
English : nickname from the animal, Middle English catte ‘cat’. The word is found in similar forms in most European languages from very early times (e.g. Gaelic cath, Slavic kotu). Domestic cats were unknown in Europe in classical times, when weasels fulfilled many of their functions, for example in hunting rodents. They seem to have come from Egypt, where they were regarded as sacred animals.English : from a medieval female personal name, a short form of Catherine.Variant spelling of German and Dutch Katt.
Surname or Lastname
South German
South German : occupational name for an official in charge of the legal auction of property confiscated in default of a fine; such a sale was known in Middle High German as a gant (from Italian incanto, a derivative of Late Latin inquantare ‘to auction’, from the phrase In quantum? ‘To how much (is the price raised)?’).German : metonymic occupational name for a cooper, from Middle High German ganter, kanter ‘barrel rack’.German : variant of Gander 3.English : occupational name for a glover, from Old French gantier, an agent derivative of gant ‘glove’ (see Gant).
Surname or Lastname
English (mainly southeastern)
English (mainly southeastern) : topographic name for someone who lived near a conspicuous tree, Middle English tre(w).
Girl/Female
Hindu, Indian
Fraction of the Cosmos
Girl/Female
Afghan, Arabic, Australian, Indian, Muslim
Fiction; Romance; Story
Surname or Lastname
English
English : variant of Treece.
Girl/Female
Bengali, Indian
Fraction of Time
Surname or Lastname
English
English : topographic name for someone who lived by a watercourse or road junction, Old English gelǣt, or a habitational name from Leat in Devon, or The Leete in Essex, named with this element.
Surname or Lastname
English
English : variant of Treece.
Surname or Lastname
English
English : topographic name for someone who lived by a maple tree, Middle English mapel (Old English mapul).French : from Latin mapula, a diminutive of mappa ‘piece of cloth’, ‘napkin’, presumably a metonymic occupational name for a cloth merchant or a weaver.
Boy/Male
French Greek
Cyrano de Bergerac was a seventeenth-century soldier and science-fiction writer.
FUNCTION TREE
FUNCTION TREE
Boy/Male
Arabic, Bengali, Hindu, Indian, Marathi, Muslim, Sikh, Tamil
Mind; Human; God is with us; Supernatural Power; Examine Closely; Accept the Truth; Assistance
Girl/Female
Muslim
Total submission. Salutation.
Girl/Female
Hindu
Holy
Boy/Male
British, English
Son of Rawley or Raleigh
Surname or Lastname
Irish
Irish : reduced form of O’Hayden, an Anglicized form of Gaelic Ó hÉideáin and Ó hÉidÃn ‘descendant of Éideán’ or ‘descendant of ÉidÃn’, personal names apparently from a diminutive of éideadh ‘clothes’, ‘armor’. There was also a Norman family bearing the English name (see 2 below), living in County Wexford.English : habitational name from any of various places called Hayden or Haydon. The three examples of Haydon in Northumberland are named from Old English hÄ“g ‘hay’ + denu ‘valley’. Others, for example in Dorset, Hertfordshire, Somerset, and Wiltshire, get the name from Old English hÄ“g ‘hay’ (or perhaps hege ‘hedge’ or (ge)hæg ‘enclosure’) + dÅ«n ‘hill’.Jewish : see Heiden.
Boy/Male
Muslim
Distinct, Evident, Plain, Wonderful, Marvelous, Unique
Female
Bulgarian
, beads, or, pearls.
Girl/Female
French American
The french form of the English Carol, a dimunitive of Charles meaning strong.
Boy/Male
Hindu, Indian, Marathi
Continuing; The Best; Son
Boy/Male
African, Arabic, Australian, Muslim, Swahili
Glory; Honorary; Glorious; Proud
FUNCTION TREE
FUNCTION TREE
FUNCTION TREE
FUNCTION TREE
FUNCTION TREE
v. t.
To sell by auction.
a.
Pertaining to, or connected with, a function or duty; official.
n.
The office, duties, or functions of a minister, servant, or agent; ecclesiastical, executive, or ambassadorial function or profession.
n.
The act of anointing, smearing, or rubbing with an unguent, oil, or ointment, especially for medical purposes, or as a symbol of consecration; as, mercurial unction.
v. t.
The act of uniting, or the state of being united; junction.
n.
The act of feigning, inventing, or imagining; as, by a mere fiction of the mind.
n.
The act of anointing, or the state of being anointed; unction; specifically (Med.), the rubbing of ointments into the pores of the skin, by which medicinal agents contained in them, such as mercury, iodide of potash, etc., are absorbed.
v. t.
To give sanction to; to ratify; to confirm; to approve.
n.
The appropriate action of any special organ or part of an animal or vegetable organism; as, the function of the heart or the limbs; the function of leaves, sap, roots, etc.; life is the sum of the functions of the various organs and parts of the body.
v. t.
To supply with an organ or organs having a special function or functions.
n.
The place or point of union, meeting, or junction; specifically, the place where two or more lines of railway meet or cross.
n.
The things sold by auction or put up to auction.
n.
A derived function; a function obtained from a given function by a certain algebraic process.
n.
The act of joining, or the state of being joined; union; combination; coalition; as, the junction of two armies or detachments; the junction of paths.
v. i.
Alt. of Functionate
n.
The course of action which peculiarly pertains to any public officer in church or state; the activity appropriate to any business or profession.
n.
A quantity so connected with another quantity, that if any alteration be made in the latter there will be a consequent alteration in the former. Each quantity is said to be a function of the other. Thus, the circumference of a circle is a function of the diameter. If x be a symbol to which different numerical values can be assigned, such expressions as x2, 3x, Log. x, and Sin. x, are all functions of x.
n.
The natural or assigned action of any power or faculty, as of the soul, or of the intellect; the exertion of an energy of some determinate kind.
v. t.
To separate by means of, or to subject to, fractional distillation or crystallization; to fractionate; -- frequently used with out; as, to fraction out a certain grade of oil from pretroleum.
a.
Pertaining to the function of an organ or part, or to the functions in general.