-
1 конечный поток
-
2 конечный поток
Русско-английский словарь по радиоэлектронике > конечный поток
-
3 Boole, George
SUBJECT AREA: Electronics and information technology[br]b. 2 November 1815 Lincoln, Englandd. 8 December 1864 Ballintemple, Coounty Cork, Ireland[br]English mathematician whose development of symbolic logic laid the foundations for the operating principles of modern computers.[br]Boole was the son of a tradesman, from whom he learned the principles of mathematics and optical-component manufacturing. From the early age of 16 he taught in a number of schools in West Yorkshire, and when only 20 he opened his own school in Lincoln. There, at the Mechanical Institute, he avidly read mathematical journals and the works of great mathematicians such as Lagrange, Laplace and Newton and began to tackle a variety of algebraic problems. This led to the publication of a constant stream of original papers in the newly launched Cambridge Mathematical Journal on topics in the fields of algebra and calculus, for which in 1844 he received the Royal Society Medal.In 1847 he wrote The Mathematical Analysis of Logic, which applied algebraic symbolism to logical forms, whereby the presence or absence of properties could be represented by binary states and combined, just like normal algebraic equations, to derive logical statements about a series of operations. This laid the foundations for the binary logic used in modern computers, which, being based on binary on-off devices, greatly depend on the use of such operations as "and", "nand" ("not and"), "or" and "nor" ("not or"), etc. Although he lacked any formal degree, this revolutionary work led to his appointment in 1849 to the Chair of Mathematics at Queen's College, Cork, where he continued his work on logic and also produce treatises on differential equations and the calculus of finite differences.[br]Principal Honours and DistinctionsRoyal Society Medal 1844. FRS 1857.BibliographyBoole's major contributions to logic available in republished form include George Boole: Investigation of the Laws of Thought, Dover Publications; George Boole: Laws of Thought, Open Court, and George Boole: Studies in Logic \& Probability, Open Court.1872, A Treatise on Differential Equations.Further ReadingW.Kneale, 1948, "Boole and the revival of logic", Mind 57:149.G.C.Smith (ed.), 1982, George Boole \& Augustus de Morgan. Correspondence 1842– 1864, Oxford University Press.—, 1985, George Boole: His Life and Work, McHale.E.T.Bell, 1937, Men of Mathematics, London: Victor Gollancz.KF
См. также в других словарях:
Stream X-Machine — The Stream X machine (SXM) is a model of computation introduced by Gilbert Laycock in his 1993 PhD thesis, The Theory and Practice of Specification Based Software Testing .Gilbert Laycock (1993) The Theory and Practice of Specification Based… … Wikipedia
Stream-of-consciousness technique — Der Begriff Bewusstseinsstrom (engl. stream of consciousness, oft fälschlich mit dem inneren Monolog gleichgesetzt) bezeichnet in der Literaturwissenschaft eine Erzähltechnik, die in ungeordneter Folge Bewusstseinsinhalte einer oder mehrerer… … Deutsch Wikipedia
Stream of Consciousness — Der Begriff Bewusstseinsstrom (engl. stream of consciousness, oft fälschlich mit dem inneren Monolog gleichgesetzt) bezeichnet in der Literaturwissenschaft eine Erzähltechnik, die in ungeordneter Folge Bewusstseinsinhalte einer oder mehrerer… … Deutsch Wikipedia
Stream of consciousness — Der Begriff Bewusstseinsstrom (engl. stream of consciousness, oft fälschlich mit dem inneren Monolog gleichgesetzt) bezeichnet in der Literaturwissenschaft eine Erzähltechnik, die in ungeordneter Folge Bewusstseinsinhalte einer oder mehrerer… … Deutsch Wikipedia
Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… … Wikipedia
X-Machine Testing — The (Stream) X Machine Testing Methodology is a complete functional testing approach to software and hardware testingM. Holcombe and F. Ipate (1998) Correct Systems Building a Business Process Solution . Springer, Applied Computing Series.] that… … Wikipedia
Computability — You might be looking for Computable function, Computability theory, Computation, or Theory of computation. Computability is the ability to solve a problem in an effective manner. It is a key topic of the field of computability theory within… … Wikipedia
Computability theory (computer science) — In computer science, computability theory is the branch of the theory of computation that studies which problems are computationally solvable using different models of computation.Computability theory differs from the related discipline of… … Wikipedia
Navier–Stokes equations — Continuum mechanics … Wikipedia
X-machine — The X machine ( XM ) is a theoretical model of computation introduced by Samuel Eilenberg in 1974.S. Eilenberg (1974) Automata, Languages and Machines, Vol. A . Academic Press, London.] The X in X machine represents the fundamental data type on… … Wikipedia
Modulation — For musical change of key, see Modulation (music). For other uses, see Modulation (disambiguation). Passband modulation v · d · e … Wikipedia
