Numerical Methods, Complexity, and Epistemic Hierarchies.

Modern mathematical sciences are hard to imagine without appeal to efficient computational algorithms. We address several conceptual problems arising from this interaction by outlining rival but complementary perspectives on mathematical tractability. More specifically, we articulate three alternati...

Descripción completa

Detalles Bibliográficos
Publicado en:Philosophy of Science Vol. 82; no. 5; pp. 941 - 956
Autores principales: Fillion, Nicolas, Bangu, Sorin
Formato: Artículo
Publicado: Cambridge University Press Dec2015
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=111483399&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 111483399
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00318248
        PSC
      jtl: Philosophy of Science
      issn: 00318248
      maglogo: N
    pubinfo:
      dt: Dec2015
      vid: 82
      iid: 5
      pid: 15979
      pub: Cambridge University Press
    artinfo:
      ui:
        111483399
        10.1086/683343
      ppf: 941
      ppct: 15
      formats:
        fmt:
          – @attributes:
              type: T
          – @attributes:
              type: P
              size: 579KB
      tig:
        atl: Numerical Methods, Complexity, and Epistemic Hierarchies.
      aug:
        au:
          Fillion, Nicolas
          Bangu, Sorin
      su:
        Mathematical models
        Complexity (Philosophy)
        Philosophy of mathematics
        Mathematics problems & exercises
        Philosophy of science
      sug:
        subj:
          Mathematical models
          Complexity (Philosophy)
          Philosophy of mathematics
          Mathematics problems & exercises
          Philosophy of science
      ab: Modern mathematical sciences are hard to imagine without appeal to efficient computational algorithms. We address several conceptual problems arising from this interaction by outlining rival but complementary perspectives on mathematical tractability. More specifically, we articulate three alternative characterizations of the complexity hierarchy of mathematical problems that are themselves based on different understandings of computational constraints. These distinctions resolve the tension between epistemic contexts in which exact solutions can be found and the ones in which they cannot; however, contrary to a persistent myth, we conclude that having an exact solution is not generally more epistemologically beneficial than lacking one.
      pubtype: Academic Journal
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      custom: Copyright of Philosophy of Science is the property of Cambridge University Press and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use.
      item: Philosophy of Science
      holder: Cambridge University Press
      dt:
        @attributes:
          year: 2015
    holdings:
      @attributes:
        islocal: N