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 .

Product Description

Book by Jeffries C

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Descrizione libreria

We sell textbooks to students at very affordable prices. All books are brand new, satisfaction guaranteed.

Visita la pagina della libreria

Informazioni sull?azienda del venditore

Romtrade Corp.
39137 BYERS DR., STERLING HEIGHTS, MI, 48310, U.S.A.

Condizioni di vendita e spedizione

Condizioni di vendita

We guarantee the condition of every book as it's described on the Abebooks web
sites. If you're dissatisfied with your purchase (Incorrect Book/Not as
Described/Damaged) or if the order hasn't arrived, you're eligible for a refund
within 30 days of the estimated delivery date. If you've changed your mind about
a book that you've ordered, please use the Ask bookseller a question link to
contact us and we'll respond within 2 business days. The contact persons name is
Constantin Marandici and the m...

Ulteriori informazioni

Condizioni di spedizione

Orders usually ship within 2 business days. Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required. We use USPS, DHL and ARAMEX for shipping. We ship our product from the US or other locations in India depending on your location and availability.