7 found
Sort by:
  1. Iris Rooij, Cory D. Wright & Todd Wareham (2012). Intractability and the Use of Heuristics in Psychological Explanations. Synthese 187 (2):471-487.
    Many cognitive scientists, having discovered that some computational-level characterization f of a cognitive capacity φ is intractable, invoke heuristics as algorithmic-level explanations of how cognizers compute f. We argue that such explanations are actually dysfunctional, and rebut five possible objections. We then propose computational-level theory revision as a principled and workable alternative.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  2. Johan Kwisthout, Todd Wareham & Iris van Rooij (2011). Bayesian Intractability Is Not an Ailment That Approximation Can Cure. Cognitive Science 35 (5):779-784.
    Bayesian models are often criticized for postulating computations that are computationally intractable (e.g., NP-hard) and therefore implausibly performed by our resource-bounded minds/brains. Our letter is motivated by the observation that Bayesian modelers have been claiming that they can counter this charge of “intractability” by proposing that Bayesian computations can be tractably approximated. We would like to make the cognitive science community aware of the problematic nature of such claims. We cite mathematical proofs from the computer science literature that show intractable (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  3. Iris van Rooij, Johan Kwisthout, Mark Blokpoel, Jakub Szymanik, Todd Wareham & Ivan Toni (2011). Intentional Communication: Computationally Easy or Difficult? Frontiers in Human Neuroscience 5.
    Human intentional communication is marked by its flexibility and context sensitivity. Hypothesized brain mechanisms can provide convincing and complete explanations of the human capacity for intentional communication only insofar as they can match the computational power required for displaying that capacity. It is thus of importance for cognitive neuroscience to know how computationally complex intentional communication actually is. Though the subject of considerable debate, the computational complexity of communication remains so far unknown. In this paper we defend the position that (...)
    Direct download (9 more)  
     
    My bibliography  
     
    Export citation  
  4. Moritz Müller, Iris van Rooij & Todd Wareham (2009). Similarity as Tractable Transformation. In N. A. Taatgen & H. van Rijn (eds.), Proceedings of the 31st Annual Conference of the Cognitive Science Society.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  5. Iris van Rooij, Patricia Evans, Moritz Müller, Jason Gedge & Todd Wareham (2008). Identifying Sources of Intractability in Cognitive Models: An Illustration Using Analogical Structure Mapping. In B. C. Love, K. McRae & V. M. Sloutsky (eds.), Proceedings of the 30th Annual Conference of the Cognitive Science Society. Cognitive Science Society.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  6. Todd Wareham, Iris van Rooij & Moritz Müller (2008). Computational Complexity Analysis Can Help, but First We Need a Theory. Behavioral and Brain Sciences 31 (4):399-400.
    Leech et al. present a connectionist algorithm as a model of (the development) of analogizing, but they do not specify the algorithm's associated computational-level theory, nor its computational complexity. We argue that doing so may be essential for connectionist cognitive models to have full explanatory power and transparency, as well as for assessing their scalability to real-world input domains.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  7. Todd Wareham, Iris van Rooij & Moritz Müller (2008). Computational Complexity Analysis Can Help, but First We Need a Theory. Behavioral and Brain Sciences 31 (4):399-400.
    Leech et al. present a connectionist algorithm as a model of (the development) of analogizing, but they do not specify the algorithm's associated computational-level theory, nor its computational complexity. We argue that doing so may be essential for connectionist cognitive models to have full explanatory power and transparency, as well as for assessing their scalability to real-world input domains.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation