-
1 Boolean mathematics
Большой англо-русский и русско-английский словарь > Boolean mathematics
-
2 Boolean mathematics
Вычислительная техника: булева алгебра, булевая алгебра -
3 Boolean mathematics
English-Russian electronics dictionary > Boolean mathematics
-
4 Boolean mathematics
The New English-Russian Dictionary of Radio-electronics > Boolean mathematics
-
5 Boolean mathematics
English-Russian dictionary of computer science and programming > Boolean mathematics
-
6 boolean mathematics
• booleova algebra; bulova algebra -
7 Boolean mathematics
-
8 Boolean mathematics
English-Russian information technology > Boolean mathematics
-
9 Boolean mathematics
The English-Russian dictionary on reliability and quality control > Boolean mathematics
-
10 Boolean
1. булево выражение; булев; логический2. булиев -
11 mathematics
а) наука, изучающая количественные соотношения между величинами и пространственными формами в символическом представленииб) математический аппарат; математические действия, процедуры, методы и свойства- applied mathematics
- Boolean mathematics
- calculus mathematics
- combinatorial mathematics
- computational mathematics
- concrete mathematics
- crystal mathematics
- discrete mathematics
- elementary mathematics
- higher mathematics
- pure mathematics
- recreational mathematics -
12 mathematics
а) наука, изучающая количественные соотношения между величинами и пространственными формами в символическом представленииб) математический аппарат; математические действия, процедуры, методы и свойства•- Boolean mathematics
- calculus mathematics
- combinatorial mathematics
- computational mathematics
- concrete mathematics
- crystal mathematics
- discrete mathematics
- elementary mathematics
- higher mathematics
- mathematics of logic
- pure mathematics
- recreational mathematicsThe New English-Russian Dictionary of Radio-electronics > mathematics
-
13 mathematics
English-Russian dictionary of computer science and programming > mathematics
-
14 Boolean algebra
mathematics• Boolen algebra -
15 boolean ring
பூலியன் வளையம் -
16 boolean algebra
Iபூலியன் இயற்கணிதம்IIsee: algebraபூவின் அல்ஜீப்ரா, பூல்இயற்கணிதம்IVபோல் இயற் கணிதம் -
17 булева алгебра
Большой англо-русский и русско-английский словарь > булева алгебра
-
18 Shannon, Claude Elwood
[br]b. 30 April 1916 Gaylord, Michigan, USA[br]American mathematician, creator of information theory.[br]As a child, Shannon tinkered with radio kits and enjoyed solving puzzles, particularly crypto-graphic ones. He graduated from the University of Michigan in 1936 with a Bachelor of Science in mathematics and electrical engineering, and earned his Master's degree from the Massachusetts Institute of Technology (MIT) in 1937. His thesis on applying Boolean algebra to switching circuits has since been acclaimed as possibly the most significant this century. Shannon earned his PhD in mathematics from MIT in 1940 with a dissertation on the mathematics of genetic transmission.Shannon spent a year at the Institute for Advanced Study in Princeton, then in 1941 joined Bell Telephone Laboratories, where he began studying the relative efficiency of alternative transmission systems. Work on digital encryption systems during the Second World War led him to think that just as ciphers hide information from the enemy, "encoding" information could also protect it from noise. About 1948, he decided that the amount of information was best expressed quantitatively in a two-value number system, using only the digits 0 and 1. John Tukey, a Princeton colleague, named these units "binary digits" (or, for short, "bits"). Almost all digital computers and communications systems use such on-off, or two-state logic as their basis of operation.Also in the 1940s, building on the work of H. Nyquist and R.V.L. Hartley, Shannon proved that there was an upper limit to the amount of information that could be transmitted through a communications channel in a unit of time, which could be approached but never reached because real transmissions are subject to interference (noise). This was the beginning of information theory, which has been used by others in attempts to quantify many sciences and technologies, as well as subjects in the humanities, but with mixed results. Before 1970, when integrated circuits were developed, Shannon's theory was not the preferred circuit-and-transmission design tool it has since become.Shannon was also a pioneer in the field of artificial intelligence, claiming that computing machines could be used to manipulate symbols as well as do calculations. His 1953 paper on computers and automata proposed that digital computers were capable of tasks then thought exclusively the province of living organisms. In 1956 he left Bell Laboratories to join the MIT faculty as Professor of Communications Science.On the lighter side, Shannon has built many devices that play games, and in particular has made a scientific study of juggling.[br]Principal Honours and DistinctionsNational Medal of Science. Institute of Electrical and Electronics Engineers Medal of Honor, Kyoto Prize.BibliographyHis seminal paper (on what has subsequently become known as information theory) was entitled "The mathematical theory of communications", first published in Bell System Technical Journal in 1948; it is also available in a monograph (written with Warren Weaver) published by the University of Illinois Press in 1949, and in Key Papers in the Development of Information Theory, ed. David Slepian, IEEE Press, 1974, 1988. For readers who want all of Shannon's works, see N.J.A.Sloane and A.D.Wyner, 1992, TheCollected Papers of Claude E.Shannon.HO
См. также в других словарях:
Boolean algebras canonically defined — Boolean algebras have been formally defined variously as a kind of lattice and as a kind of ring. This article presents them more neutrally but equally formally as simply the models of the equational theory of two values, and observes the… … Wikipedia
Boolean algebra (introduction) — Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… … Wikipedia
Boolean logic — is a complete system for logical operations. It was named after George Boole, who first defined an algebraic system of logic in the mid 19th century. Boolean logic has many applications in electronics, computer hardware and software, and is the… … Wikipedia
mathematics, foundations of — Scientific inquiry into the nature of mathematical theories and the scope of mathematical methods. It began with Euclid s Elements as an inquiry into the logical and philosophical basis of mathematics in essence, whether the axioms of any system… … Universalium
Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… … Wikipedia
Boolean algebra (structure) — For an introduction to the subject, see Boolean algebra#Boolean algebras. For the elementary syntax and axiomatics of the subject, see Boolean algebra (logic). For an alternative presentation, see Boolean algebras canonically defined. In abstract … Wikipedia
Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… … Wikipedia
Boolean prime ideal theorem — In mathematics, a prime ideal theorem guarantees the existence of certain types of subsets in a given abstract algebra. A common example is the Boolean prime ideal theorem, which states that ideals in a Boolean algebra can be extended to prime… … Wikipedia
Boolean-valued function — A boolean valued function, in some usages a predicate or a proposition, is a function of the type f : X → B, where X is an arbitrary set and where B is a boolean domain.A boolean domain B is a generic 2 element set, say, B = {0, 1}, whose… … Wikipedia
Boolean domain — In mathematics and abstract algebra, a Boolean domain is a set consisting of exactly two elements whose interpretations include false and true . In mathematics and theoretical computer science, a Boolean domain is usually written as {0,1} or {ot … Wikipedia
Boolean algebra (logic) — For other uses, see Boolean algebra (disambiguation). Boolean algebra (or Boolean logic) is a logical calculus of truth values, developed by George Boole in the 1840s. It resembles the algebra of real numbers, but with the numeric operations of… … Wikipedia