Intractability and the use of heuristics in psychological explanations.

Many cognitive scientists, having discovered that some computational-level characterization f of a cognitive capacity $${\phi}$$ is intractable, invoke heuristics as algorithmic-level explanations of how cognizers compute f. We argue that such explanations are actually dysfunctional, and rebut five...

Descripción completa

Detalles Bibliográficos
Publicado en:Synthese Vol. 187; no. 2; pp. 471 - 488
Autores principales: Rooij, Iris, Wright, Cory, Wareham, Todd
Formato: Artículo
Publicado: Springer Nature Jul2012
Materias:
Acceso en línea:Ver este registro en EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=78217470&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 78217470
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00397857
        4LI
      jtl: Synthese
      issn: 00397857
      maglogo: N
    pubinfo:
      dt: Jul2012
      vid: 187
      iid: 2
      pid: 237
      pub: Springer Nature
    artinfo:
      ui:
        78217470
        10.1007/s11229-010-9847-7
      ppf: 471
      ppct: 17
      formats:
        fmt:
          @attributes:
            type: P
            size: 216KB
      tig:
        atl: Intractability and the use of heuristics in psychological explanations.
      aug:
        au:
          Rooij, Iris
          Wright, Cory
          Wareham, Todd
        affil:
          Donders Institute for Brain, Cognition, and Behaviour, Radboud University Nijmegen, Nijmegen The Netherlands
          Department of Philosophy, California State University Long Beach, Long Beach USA
          Department of Computer Science, Memorial University of Newfoundland, St. John's NL Canada
      su:
        Heuristic algorithms
        Psychology
        Cognitive science
        Computational complexity
        Scientists
      sug:
        subj:
          Heuristic algorithms
          Psychology
          Cognitive science
          Computational complexity
          Scientists
      keyword:
        Algorithm
        Approximation
        Computational-level theory
        Heuristics
        Intractability
        NP-hard
        Psychological explanation
      ab: Many cognitive scientists, having discovered that some computational-level characterization f of a cognitive capacity $${\phi}$$ 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.
      pubtype: Academic Journal
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      custom: Synthese is a copyright of Springer, 2012. All Rights Reserved.
      item: Synthese
      holder: Springer Nature
      dt:
        @attributes:
          year: 2012
    holdings:
      @attributes:
        islocal: N