- probabilistic machine
- мат. вероятностная машина
Большой англо-русский и русско-английский словарь. 2001.
probabilistic machine
Смотреть что такое "probabilistic machine" в других словарях:
probabilistic machine — /prɒbəbəˈlɪstɪk məˌʃin/ (say probuhbuh listik muh.sheen) noun a model of a physically realisable machine simulated by a digital computer in order to exercise a limited number of states of the machine in an apparently random sequence …
Probabilistic latent semantic analysis — (PLSA), also known as probabilistic latent semantic indexing (PLSI, especially in information retrieval circles) is a statistical technique for the analysis of two mode and co occurrence data. PLSA evolved from Latent semantic analysis, adding a… … Wikipedia
Probabilistic design — is a discipline within Engineering Design. It deals primarily with the consideration of the effects of random variability upon the performance of an engineering system during the design phase. Typically, these effects are related to quality and… … Wikipedia
Machine learning — is a subfield of artificial intelligence that is concerned with the design and development of algorithms and techniques that allow computers to learn . In general, there are two types of learning: inductive, and deductive. Inductive machine… … Wikipedia
Probabilistic Turing machine — Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine Read only right moving Turing Machines Probabilistic Turing machine Multi track Turing machine Turing machine… … Wikipedia
Classification in machine learning — See also: Pattern recognition This section needs integrating with Statistical classification (Discuss). Integration means cross linking and distinguishing (to/from each other), or sometimes merging (if consensus suggests). In machine learning and … Wikipedia
Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… … Wikipedia
Non-deterministic Turing machine — Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine Read only right moving Turing Machines Probabilistic Turing machine Multi track Turing machine Turing machine… … Wikipedia
Support vector machine — Support vector machines (SVMs) are a set of related supervised learning methods used for classification and regression. Viewing input data as two sets of vectors in an n dimensional space, an SVM will construct a separating hyperplane in that… … Wikipedia
Read-only Turing machine — A read only Turing machine or Two way deterministic finite state automaton (2DFA) is class of models of computability that behave like a standard Turing machine and can move in both directions across input, except cannot write to its input tape.… … Wikipedia
Digital probabilistic physics — is a branch of digital philosophy which holds that the universe exists as a nondeterministic state machine. The notion of the universe existing as a state machine was first postulated by Konrad Zuse s book Rechnender Raum. Adherents hold that the … Wikipedia
