Hardcover. Zustand: Good. 1998. It's a preowned item in good condition and includes all the pages. It may have some general signs of wear and tear, such as markings, highlighting, slight damage to the cover, minimal wear to the binding, etc., but they will not affect the overall reading experience.
Zustand: Good. 1st Edition. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.
hardcover. Zustand: Very Good. May have light to moderate shelf wear and/or a remainder mark. Complete. Clean pages.
Verlag: New York. Springer-Verlag., 1998
ISBN 10: 0387982817 ISBN 13: 9780387982816
Sprache: Englisch
Anbieter: Antiquariat Bernhardt, Kassel, Deutschland
Karton. Zustand: Sehr gut. Zust: Gutes Exemplar. 453 Seiten, mit Abbildungen, Englisch 818g.
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.
EUR 57,07
Anzahl: 1 verfügbar
In den WarenkorbZustand: New. pp. 474.
Verlag: Springer, New York, 1998
Sprache: Englisch
Anbieter: Antiquariat Renner OHG, Albstadt, Deutschland
Verbandsmitglied: BOEV
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.
EUR 81,91
Anzahl: 2 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. reprint edition. 469 pages. 9.25x6.10x1.18 inches. In Stock.
EUR 156,56
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 1st edition. 453 pages. 9.75x6.50x1.25 inches. In Stock.
Erscheinungsdatum: 1989
Anbieter: Jeremy Norman's historyofscience, Novato, CA, USA
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. .