Code Recognition and Set Selection with Neutral Networks von Jeffries, Clark: Very Good Hardcover (1991)

Beschreibung

VERY GOOD hardcover, no marks in text, tight square spine; bright and clean.

Bestandsnummer des Verk�ufers 041017

Verk�ufer kontaktieren

Diesen Artikel melden

Bibliografische Details

Titel

Code Recognition and Set Selection with Neutral Networks

Verlag

Birkhauser, Boston, MA, U.S.A.

Ver�ffentlichungsdatum

1991

Sprache

Englisch

ISBN-10

0817635858

ISBN-13

9780817635855

Bindung

Hardcover

Zustand

Very Good

Buchtyp

Book

Verk�uferkataloge

�ber diesen Titel

Inhaltsangabe

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 .

Rese�a del editor

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 .

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.