Contact
How to shop
Delivery
Shopping guide
Switching in Boolean Circuits and Modelling Cognition through Neuroids
An in-depth analysis of switching lemmas for Boolean circuits and a critique of Valiant's neuroidal model for cognition
English
78 b
Up to 30 days for returns
Customers also purchased
In computational complexity theory, Hĺstad's switching lemma is a vital analytical tool for proving lower bounds on the size of constant-depth Boolean circuits. In essence, the switching lemma says that, given an arbitrary formula in disjunctive normal form, if we set some fraction of the variables randomly, then with high probability, the restricted function can be computed by a decision tree of small depth. The first chapter of this book begins with a discussion on Hĺstad's switching lemma, and its usefulness in proving that PARITY does not belong to AC0. Then, it moves on to discussing the extended switching lemma and its proof. The second chapter critiques the neuroidal model for cognition proposed by Valiant. It starts off by discussing the motivation behind Valiant's work, and then explores the physiology of the brain and some insights from cognitive psychology that led to this model. Next, the actual model is described in extensive detail, and the algorithm put forward by Valiant for implementing unsupervised memorization within his model is presented as a case study. The book concludes by stating the relevance of the neuroidal model for building cognitive computing systems.
About the book
English
Categories
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
20.26
€
/
Paperback
17.32
€
/
Paperback
15.50
€
/
Paperback
26.75
€
/
Adobe ePub DRM
4.96
€
