Code Recognition and Set Selection with Neural Networks

C. Jeffries

ISBN 10: 1461278368 / ISBN 13: 9781461278368

Edité par Springer Nature B.V. Nov 2011, 2011

A propos de cet article

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 .

N° de réf. du vendeur 9781461278368

Détails bibliographiques

• Titre: Code Recognition and Set Selection with Neural Networks
• Éditeur: Springer Nature B.V. Nov 2011
• Date de parution: 2011
• Langue: anglais
• ISBN à 10 chiffres: 1461278368
• ISBN à 13 chiffres: 9781461278368
• Reliure: Taschenbuch
• État de l'article: Neu
• Dimensions: 234 L x 156 H x 10 P (en millimètres) 234 millimètres de largeur par 156 millimètres de hauteur par 10 millimètres de profondeur
• Poids: 259 grammes

A propos de ce titre

Synopsis

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 .