Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 59,11
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
EUR 64,27
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. KlappentextIn mathematics there are limits, speed limits of a sort, on how many computational steps are required to solve certain problems. The theory of computational complexity deals with such limits, in particular whether solving an n.
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 71,68
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbZustand: New. pp. 166.
Verlag: Springer Nature B.V. Nov 2011, 2011
ISBN 10: 1461278368 ISBN 13: 9781461278368
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
EUR 82,48
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbTaschenbuch. Zustand: Neu. Neuware - In mathematics there are limits, speed limits of a sort, on how many computational steps are required to solve certain problems. The theory of computational complexity deals with such limits, in particular whether solving an n-dimensional version of a particular problem can be accomplished with, say, 2 n n steps or will inevitably require 2 steps. Such a bound, together with a physical limit on computational speed in a machine, could be used to establish a speed limit for a particular problem. But there is nothing in the theory of computational complexity which precludes the possibility of constructing analog devices that solve such problems faster. It is a general goal of neural network researchers to circumvent the inherent limits of serial computation. As an example of an n-dimensional problem, one might wish to order n distinct numbers between 0 and 1. One could simply write all n! ways to list the numbers and test each list for the increasing property. There are much more efficient ways to solve this problem; in fact, the number of steps required by the best sorting algorithm applied to this problem is proportional to n In n .