См. также в других словарях:
Binary-safe — is mainly used in connection with string manipulating functions. A binary safe function is essentially one that treats its input as a raw stream of data without any specific format. It should thus work with all 256 possible values that a… … Wikipedia
Binary-to-text encoding — A binary to text encoding is encoding of data in plain text. More precisely, it is an encoding of binary data in a sequence of ASCII printable characters. These encodings are necessary for transmission of data when the channel or the protocol… … Wikipedia
Binary symmetric channel — A binary symmetric channel (or BSC) is a common communications channel model used in coding theory and information theory. In this model, a transmitter wishes to send a bit (a zero or a one), and the receiver receives a bit. It is assumed that… … Wikipedia
Function problem — In computational complexity theory, a function problem is a problem other than a decision problem, that is, a problem requiring a more complex answer than just YES or NO.Notable examples include the travelling salesman problem, which asks for the … Wikipedia
Function (mathematics) — f(x) redirects here. For the band, see f(x) (band). Graph of example function, In mathematics, a function associates one quantity, the a … Wikipedia
Binary function — In mathematics, a binary function, or function of two variables, is a function which takes two inputs. Precisely stated, a function f is binary if there exists sets X, Y, Z such that:,f colon X imes Y ightarrow Zwhere X imes Y is the Cartesian… … Wikipedia
Binary heap — Example of a complete binary max heap Example of a complete binary min heap A binary … Wikipedia
Hash function — A hash function is any well defined procedure or mathematical function for turning some kind of data into a relatively small integer, that may serve as an index into an array. The values returned by a hash function are called hash values, hash… … Wikipedia
Computable function — Total recursive function redirects here. For other uses of the term recursive function , see Recursive function (disambiguation). Computable functions are the basic objects of study in computability theory. Computable functions are the formalized … Wikipedia
Activation function — In computational networks, the activation function of a node defines the output of that node given an input or set of inputs. A standard computer chip circuit can be seen as a digital network of activation functions that can be ON (1) or OFF (0) … Wikipedia
C file input/output — C Standard Library Data types Character classification Strings Mathematics File input/output Date/time Localiza … Wikipedia
