Filter by
Explaining the computational mind
In this work, Marcin Milkowski argues that the mind can be explained computationally because it is itself computational - whether it engages in mental arithmetic, parses natural language, or processes the auditory signals that allow us to experience music.OCLC-licensed vendor bibliographic record.
- Edition
- -
- ISBN/ISSN
- 9780262313919
- Collation
- 1 online resource (x, 243 pages)
- Series Title
- -
- Call Number
- -
Neural network design and the complexity of learning
"A Bradford book.""Using the tools of complexity theory, Stephen Judd develops a formal description of associative learning in connectionist networks. He rigorously exposes the computational difficulties in training neural networks and explores how certain design principles will or will not make the problems easier. Judd looks beyond the scope of any one particular learning rule, at a level abo…
- Edition
- -
- ISBN/ISSN
- 0585359342
- Collation
- 1 online resource (150 pages) :illustrations.
- Series Title
- -
- Call Number
- -
Circuit Complexity and Neural Networks
Neural 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 circ…
- Edition
- -
- ISBN/ISSN
- 9780262281249
- Collation
- 1 online resource (xxix, 270 pages) :illustrations.
- Series Title
- -
- Call Number
- -
Communication Complexity: A New Approach to Circuit Depth
Communication Complexity describes a new intuitive model for studying circuit networks that captures the essence of circuit depth. Although the complexity of boolean functions has been studied for almost 4 decades, the main problems the inability to show a separation of any two classes, or to obtain nontrivial lower bounds remain unsolved. The communication complexity approach provides clues as…
- Edition
- -
- ISBN/ISSN
- 9780262256490
- Collation
- 1 online resource (68 pages).
- Series Title
- -
- Call Number
- -
Computability and Complexity: From a Programming Perspective
OCLC-licensed vendor bibliographic record.
- Edition
- -
- ISBN/ISSN
- 9780262276368
- Collation
- 1 online resource (xvi, 466 pages).
- Series Title
- -
- Call Number
- -
Computational Theories of Interaction and Agency
"Reprinted from Artificial intelligence, volume 72, numbers 1-2 (January 1995) and volume 73, numbers 1-2 (February 1995)"--Title page verso.Over time the field of artificial intelligence has developed an "agent perspective" expanding its focus from thought to action, from search spaces to physical environments, and from problem-solving to long-term activity. Originally published as a special d…
- Edition
- 1st MIT Press ed.
- ISBN/ISSN
- 9780262291040
- Collation
- 1 online resource (vi, 767 pages) :illustrations.
- Series Title
- -
- Call Number
- -
Using hard problems to create pseudorandom generators
"Noam Nisan is Lecturer in the Department of Computer Science at Hebrew University in Jerusalem. He received his doctoral degree from the University of California, Berkeley.""Randomization is an important tool in the design of algorithms, and the ability of randomization to provide enhanced power is a major research topic in complexity theory. Noam Nisan continues the investigation into the pow…
- Edition
- -
- ISBN/ISSN
- 9780262256728
- Collation
- 1 online resource (vi, 43 pages).
- Series Title
- -
- Call Number
- -
Computer Science, Information & General Works 
Philosophy & Psychology 
Religion 
Social Sciences 
Language 
Pure Science 
Applied Sciences 
Art & Recreation 
Literature 
History & Geography