Tree bog — A Treebog is a form of compost toilet which has willows, nettles and other nutrient hungry plants planted around it. The faeces are held in a chamber open to the air which allows it to decompose rapidly, feeding the trees around it. Unlike a… … Wikipedia
Ackermann function — In recursion theory, the Ackermann function or Ackermann Péter function is a simple example of a general recursive function that is not primitive recursive. General recursive functions are also known as computable functions. The set of primitive… … Wikipedia
Christmas tree (oil well) — Oil well Christmas tree In petroleum and natural gas extraction, a Christmas tree, or tree , (not wellhead as sometimes incorrectly referred to) is an assembly of valves, spools, and fittings used for an oil well, gas well, water injection well,… … Wikipedia
Map (higher-order function) — In many programming languages, map is the name of a higher order function that applies a given function to each element of a list, returning a list of results. They are examples of both catamorphisms and anamorphisms. This is often called apply… … Wikipedia
Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… … Wikipedia
Red-black tree — A red black tree is a type of self balancing binary search tree, a data structure used in computer science, typically used to implement associative arrays. The original structure was invented in 1972 by Rudolf Bayer who called them symmetric… … Wikipedia
Cryptographic hash function — A cryptographic hash function (specifically, SHA 1) at work. Note that even small changes in the source input (here in the word over ) drastically change the resulting output, by the so called avalanche effect. A cryptographic hash function is a… … Wikipedia
Iterated function system — In mathematics, iterated function systems or IFSs are a method of constructing fractals; the resulting constructions are always self similar.IFS fractals as they are normally called can be of any number of dimensions, but are commonly computed… … Wikipedia
Anonymous function — In computing, an anonymous function is a function (or a subroutine) defined, and possibly called, without being bound to a name. In lambda calculus, all functions are anonymous. The Y combinator can be utilised in these circumstances to provide… … Wikipedia
Minkowski's question mark function — Minkowski question mark function. ?(x) is on the left and ?(x) x is on the right. In … Wikipedia
