Deze website maakt gebruik van cookies. Klik hier voor meer informatie.X sluit
Uitgebreid zoeken
Boek

Cognition And Intractability

A Guide To Classical And Parameterized Complexity Analysis

Cognition And Intractability - Wareham, Todd (memorial University Of Newfoundland); Kwisthout, Johan (radboud Universiteit Nijmegen); Blokpoel, Mark (radboud Universiteit Nijmegen); Van Rooij, Iris (radboud Universiteit Nijmegen) - ISBN: 9781108728973
Prijs: € 41,50
Levertijd: 8 tot 12 werkdagen
Bindwijze: Boek
Genre: Psychologie
Boekenliefde.nl:
Cognition And Intractability op boekenliefde.nl
Add to cart

Beschrijving

Provides an accessible introduction to computational complexity analysis and its application to questions of intractability in cognitive science.

Details

Titel: Cognition And Intractability
auteur: Wareham, Todd (memorial University Of Newfoundland); Kwisthout, Johan (radboud Universiteit Nijmegen); Blokpoel, Mark (radboud Universiteit Nijmegen); Van Rooij, Iris (radboud Universiteit Nijmegen)
Mediatype: Boek
Taal: Engels
Aantal pagina's: 374
Uitgever: Cambridge University Press
Plaats van publicatie: 03
NUR: Psychologie
Afmetingen: 228 x 151 x 20
Gewicht: 540 gr
ISBN/ISBN13: 9781108728973
Intern nummer: 43191213

Biografie (woord)

Todd Wareham is a computer scientist in the Department of Computer Science at Memorial University of Newfoundland, Canada.

Quote

'Current theories in cognitive science think of mental processes as computational, but they rarely provide rigorous analysis of the relevant computations. Cognition and Intractability applies computational complexity theory to the kinds of inference that are important for human thinking. The results are mathematically elegant, pedagogically helpful, and very useful for understanding the kinds of computational processes that minds use.' Paul Thagard, University of Waterloo, Canada

Inhoudsopgave

Part I. Introduction: 1. Introduction; Part II. Concepts and Techniques: 2. Polynomial versus exponential time; 3. Polynomial-time reductions; 4. Classical complexity classes; 5. Fixed-parameter tractable time; 6. Parameterized reductions; 7. Parameterized complexity classes; Part III. Reflections and Elaborations: 8. Dealing with intractability; 9. Replies to common objections; Part IV. Applications: 10. Coherence as constraint satisfaction; 11. Analogy as structure mapping; 12. Communication as Bayesian inference.

Winkelvoorraad

Dit product is op dit moment niet op voorraad in een van onze vestigingen.