- probabilistically independent
- мат. независимый в вероятностном смысле
Большой англо-русский и русско-английский словарь. 2001.
probabilistically independent
Смотреть что такое "probabilistically independent" в других словарях:
Influence diagram — An influence diagram (ID) (also called a relevance diagram, decision diagram or a decision network) is a compact graphical and mathematical representation of a decision situation. It is a generalization of a Bayesian network, in which not only… … Wikipedia
Kolmogorov's zero-one law — In probability theory, Kolmogorov s zero one law, named in honor of Andrey Nikolaevich Kolmogorov, specifies that a certain type of event, called a tail event , will either almost surely happen or almost surely not happen; that is, the… … Wikipedia
Lack-of-fit sum of squares — In statistics, a sum of squares due to lack of fit, or more tersely a lack of fit sum of squares, is one of the components of a partition of the sum of squares in an analysis of variance, used in the numerator in an F test of the null hypothesis… … Wikipedia
Probability interpretations — The word probability has been used in a variety of ways since it was first coined in relation to games of chance. Does probability measure the real, physical tendency of something to occur, or is it just a measure of how strongly one believes it… … Wikipedia
Propensity probability — The propensity theory of probability is one interpretation of the concept of probability. Theorists who adopt this interpretation think of probability as a physical propensity, or disposition, or tendency of a given type of physical situation to… … Wikipedia
Martingale (probability theory) — For the martingale betting strategy , see martingale (betting system). Stopped Brownian motion is an example of a martingale. It can be used to model an even coin toss betting game with the possibility of bankruptcy. In probability theory, a… … Wikipedia
Socratic Puzzles — is a collection of essays by libertarian philosopher Robert Nozick. It was published in 1997 by Harvard University Press. ynopsis Introduction Nozick disclaims the title political philosopher and characterizes his Anarchy, State, and Utopia as an … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Common-cause and special-cause — Type of variation Synonyms Common cause Chance cause Non assignable cause Noise Natural pattern Special cause Assignable cause Signal Unnatural pattern Common and special causes are the two distinct origins of variation in a process, as defined… … Wikipedia
PCP theorem — In computational complexity theory, the PCP theorem states that every decision problem in the NP complexity class has probabilistically checkable proofs (proofs that can be checked by a randomized algorithm) of constant query complexity and… … Wikipedia
Photon — This article is about the elementary particle of light. For other uses, see Photon (disambiguation). Photon Photons emitted in a coherent beam from a laser Composition Elementary particle … Wikipedia
