- probabilistic generalization
- мат. вероятностное обобщение
Большой англо-русский и русско-английский словарь. 2001.
probabilistic generalization
Смотреть что такое "probabilistic generalization" в других словарях:
Probabilistic logic — The aim of a probabilistic logic (or probability logic) is to combine the capacity of probability theory to handle uncertainty with the capacity of deductive logic to exploit structure. The result is a richer and more expressive formalism with a… … Wikipedia
Probabilistic automaton — In mathematics and computer science, the probabilistic automaton (PA) is a generalization of the non deterministic finite automaton; it includes the probability of a given transition into the transition function, turning it into a transition… … Wikipedia
Probabilistic metric space — A probabilistic metric space is a generalization of metric spaces where the distance is no longer defined on positive real numbers, but on distribution functions. Let D + be the set of all probability distribution functions F such that F (0) = 0… … Wikipedia
Pigeonhole principle — A photograph of pigeons in holes. Here there are n = 10 pigeons in m = 9 holes, so by the pigeonhole principle, at least one hole has more than one pigeon: in this case, both of the top corner holes contain two pigeons. The principle says nothing … Wikipedia
Raven paradox — The Raven paradox, also known as Hempel s paradox or Hempel s ravens is a paradox proposed by the German logician Carl Gustav Hempel in the 1940s to illustrate a problem where inductive logic violates intuition. It reveals the problem of… … Wikipedia
automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… … Universalium
science, philosophy of — Branch of philosophy that attempts to elucidate the nature of scientific inquiry observational procedures, patterns of argument, methods of representation and calculation, metaphysical presuppositions and evaluate the grounds of their validity… … Universalium
Collatz conjecture — Directed graph showing the orbits of small numbers under the Collatz map. The Collatz conjecture is equivalent to the statement that all paths eventually lead to 1 … Wikipedia
Bloom filter — The Bloom filter, conceived by Burton H. Bloom in 1970, is a space efficient probabilistic data structure that is used to test whether an element is a member of a set. False positives are possible, but false negatives are not. Elements can be… … Wikipedia
Mean value theorem — For the theorem in harmonic function theory, see Harmonic function#Mean value property. Topics in Calculus Fundamental theorem Limits of functions Continuity Mean value theorem Differential calculus Derivative Change of variables … Wikipedia
Artificial neural network — An artificial neural network (ANN), usually called neural network (NN), is a mathematical model or computational model that is inspired by the structure and/or functional aspects of biological neural networks. A neural network consists of an… … Wikipedia
