Blum lenore (14 Ergebnisse)

Zustand: Fair. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In fair condition, suitable as a study copy. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,900grams, ISBN:9780387982816.…

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: As New. Like New condition. A near perfect copy that may have very minor cosmetic defects.

hardcover. Zustand: Good. Our good condition books are generally good for reading but not for gifting or collecting. They could have imperfections such as creasing, fanning, inscriptions, margin notes, yellowing, staining on edge or cover or pages, bumps, scuffs, etc etc (sometimes multiple of these). It's a wide category that encompasses anything that isn't almost-new down to anything that is slightly better than poor. We would NOT recommend gifting Good books - these should be considered reading copies. Our books are dispatched from a Yorkshire former cotton mill. We list via barcode/ISBN so please note that the images are stock images and may not be the exact copy you receive, furthermore the details about edition and year might not be accurate as many publishers reuse the same ISBN for multiple editions and as we simply scan a barcode or enter an ISBN we do not check the validity of the edition data when listing. If you're looking for an exact edition please don't order (at least not without checking with us first, although we don't always have time to check). We aim to dispatch prompty, the service used will depend on order value and book size. We can ship to most countries, see our shipping policies. Payment is via Abe only.…

Zustand: New. In.

Hardcover. Zustand: Sehr gut. N.Y., Springer (1998). gr.8°. 47 figs. 3 color plates. XVI, 453 p. Hardbound. Small ownership inscription on flyleaves and title, small annotation on title, otherwise in very good condition.

Zustand: Used. pp. 474.

Zustand: Used. pp. 474.

Paperback. Zustand: Brand New. reprint edition. 469 pages. 9.25x6.10x1.18 inches. In Stock.

Zustand: New. In.

Taschenbuch. Zustand: Neu. Complexity and Real Computation | Lenore Blum (u. a.) | Taschenbuch | xvi | Englisch | 2012 | Springer | EAN 9781461268734 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Hardcover. Zustand: Brand New. 1st edition. 453 pages. 9.75x6.50x1.25 inches. In Stock.

Blum, Lenore (1942- ); Manuel Blum, (1938- ); Michael Shub (1943- ). A simple unpredictable pseudo-random number generator. Offprint from SIAM Journal of Computing 15 (1986). 364-383pp. 255 x 175 mm. Original printed wrappers. Fine. First Edition, Offprint Issue. The Blum Blum Shub (BBS) pseudorandom number generator, proposed in 1986 by Lenore Blum, Manuel Blum and Michael Shub, "is based on the operation of squaring numbers modulo the products of two large primes. Its security can be reduced to the computational hardness assumption that integer factorization is infeasible." See the Wikipedia page for Blum Blum Shub. From the library of Martin Davis. . …

Blum, Lenore (1942- ); Michael Shub (1943- ); Stephen Smale (1930- ). On a theory of computation over the real numbers' NP completeness, recursive functions and universal machines. Offset typescript. 1989. 64pp. 280 x 217 mm. Unbound; stapled. Very good. Rare Preprint Edition. "In computation theory, the BlumShubSmale machine, or BSS machine, is a model of computation introduced by Lenore Blum, Michael Shub and Stephen Smale, intended to describe computations over the real numbers. Essentially, a BSS machine is a Random Access Machine with registers that can store arbitrary real numbers and that can compute rational functions over reals in a single time step. It is closely related to the Real RAM model. "BSS machines are more powerful than Turing machines, because the latter are by definition restricted to a finite set of symbols. A Turing machine can represent a countable set (such as the rational numbers) by strings of symbols, but this does not extend to the uncountable real numbers" (Wikipedia article on Blum-Shub-Smale machine). From the library of Martin Davis. .…