theor of computing
Смотреть что такое "theor of computing" в других словарях:
Molecular nanotechnology — Part of a series of articles on Molecular Nanotechnology … Wikipedia
Clyde Kruskal — Born May 25, 1954 (1954 05 25) (age 57) Nationality American Occupation Computer Scientist Known for Parallel computing … Wikipedia
Self-stabilization — is a concept of fault tolerance in distributed computing. Distributed computing systems are challenging to debug and analyze. As a result, strong properties (properties that hold under a variety of circumstances) of such systems are especially… … Wikipedia
Causal set theory bibliography — Main article: Causal Sets This Causal Set Theory Bibliography is intended to aid causal set research. It gathers together academic papers, books, talks and PhD theses related to causal set theory and is intended to help readers find references… … Wikipedia
Charles Roy Henderson — For other people named Charles Henderson, see Charles Henderson (disambiguation). Charles Roy Henderson [[File:More Henderson Biography|225px|alt=]] Born April 1, 1911 … Wikipedia
Сверхтьюринговые вычисления — Сверхтьюринговыми вычислениями (или гипервычислениями (англ. hypercomputation)) называются такие вычисления, которые не могут быть проделаны на машине Тьюринга. Они включают в себя разнообразные гипотетические методы, основанные на… … Википедия
Denotational semantics — In computer science, denotational semantics (initially known as mathematical semantics or Scott–Strachey semantics) is an approach to formalizing the meanings of programming languages by constructing mathematical objects (called denotations)… … Wikipedia
Billiard-ball computer — [ Fredkin and Toffoli Gate Billiard Ball Model] A billiard ball computer as in ref|penr is an idealized model of a computing machine based on Newtonian dynamics. Instead of using electronic signals like a conventional computer, it relies on the… … Wikipedia
Maurice Clint — was professor of Computer Science at Queen s University Belfast, Northern Ireland. His research interests include parallel algorithms for numerical linear algebra and the use of formal methods in the development of parallel and distributed… … Wikipedia
Counting points on elliptic curves — An important aspect in the study of elliptic curves is devising effective ways of counting points on the curve. There have been several approaches to do so, and the algorithms devised have proved to be useful tools in the study of various fields… … Wikipedia
Einselection — is short for environment induced superselection, a nickname coined by Wojciech H. Zurek.Wojciech H. Zurek, Decoherence, einselection, and the quantum origins of the classical, Reviews of Modern Physics 2003, 75, 715 or [http://arxiv.org/abs/quant … Wikipedia
