All listings for this product
Best-selling in Textbooks
Save on Textbooks
- AU $74.90Trending at AU $85.57
- AU $68.00Trending at AU $72.97
- AU $74.00Trending at AU $85.24
- AU $46.35Trending at AU $48.13
- AU $81.00Trending at AU $84.05
- AU $20.00Trending at AU $28.33
About this product
- DescriptionNeural networks usually work adequately on small problems but can run into trouble when they are scaled up to problems involving large amounts of input data. Circuit Complexity and Neural Networks addresses the important question of how well neural networks scale - that is, how fast the computation time and number of neurons grow as the problem size increases. It surveys recent research in circuit complexity (a robust branch of theoretical computer science) and applies this work to a theoretical understanding of the problem of scalability.Most research in neural networks focuses on learning, yet it is important to understand the physical limitations of the network before the resources needed to solve a certain problem can be calculated. One of the aims of this book is to compare the complexity of neural networks and the complexity of conventional computers, looking at the computational ability and resources (neurons and time) that are a necessary part of the foundations of neural network learning.Circuit Complexity and Neural Networks contains a significant amount of background material on conventional complexity theory that will enable neural network scientists to learn about how complexity theory applies to their discipline, and allow complexity theorists to see how their discipline applies to neural networks.
- Author(s)Ian Parberry
- PublisherMIT Press Ltd
- Date of Publication05/09/1994
- SubjectComputing: Professional & Programming
- Series TitleFoundations of Computing
- Place of PublicationCambridge, Mass.
- Country of PublicationUnited States
- ImprintMIT Press
- Content Notebibliography, index
- Weight658 g
- Width180 mm
- Height231 mm
- Spine22 mm
- Interest AgeFrom 18
This item doesn't belong on this page.
Thanks, we'll look into this.