Complexity and real computation: A manifesto

被引:22
|
作者
Blum, L
Cucker, F
Shub, M
Smale, S
机构
[1] UNIV POMPEU FABRA, E-08008 BARCELONA, SPAIN
[2] IBM CORP, THOMAS J WATSON RES CTR, YORKTOWN HTS, NY 10598 USA
[3] CITY UNIV HONG KONG, DEPT MATH, KOWLOON, HONG KONG
来源
关键词
D O I
10.1142/S0218127496001818
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Finding a natural meeting ground between the highly developed complexity theory of computer science - with its historical roots in logic and the discrete mathematics of the integers - and the traditional domain of real computation, the more eclectic less foundational field of numerical analysis - with its rich history and longstanding traditions in the continuous mathematics of analysis - presents a compelling challenge. Here we illustrate the issues and pose our perspective toward resolution.
引用
收藏
页码:3 / 26
页数:24
相关论文
共 50 条
  • [41] COMPUTATION, COMPLEXITY, AND SYSTEMS IN NATURE
    DICKINSON, BW
    BEHAVIORAL AND BRAIN SCIENCES, 1990, 13 (03) : 447 - 447
  • [42] Complexity of computation in finite fields
    Gashkov S.B.
    Sergeev I.S.
    Journal of Mathematical Sciences, 2013, 191 (5) : 661 - 685
  • [43] COMPLEXITY CONSIDERATIONS QUANTUM COMPUTATION
    Accardi, Luigi
    QUANTUM BIO-INFORMATICS V, 2013, 30 : 1 - 13
  • [44] On the Iteration Complexity of Hypergradient Computation
    Grazzi, Riccardo
    Franceschi, Luca
    Pontil, Massimiliano
    Salzo, Saverio
    25TH AMERICAS CONFERENCE ON INFORMATION SYSTEMS (AMCIS 2019), 2019,
  • [45] Towards an energy complexity of computation
    Martin, AJ
    INFORMATION PROCESSING LETTERS, 2001, 77 (2-4) : 181 - 187
  • [46] Randomness complexity of private computation
    Blundo, C
    De Santis, A
    Persiano, G
    Vaccaro, U
    COMPUTATIONAL COMPLEXITY, 1999, 8 (02) : 145 - 168
  • [47] ON THE COMPLEXITY OF GENUINELY POLYNOMIAL COMPUTATION
    KARPINSKI, M
    DERHEIDE, FMA
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 452 : 362 - 368
  • [48] State complexity and quantum computation
    Cai, Yu
    Le, Huy Nguyen
    Scarani, Valerio
    ANNALEN DER PHYSIK, 2015, 527 (9-10) : 684 - 700
  • [49] Complexity of chaos and quantum computation
    Georgeot, Bertrand
    MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2007, 17 (06) : 1221 - 1263
  • [50] On the complexity of computation of rudimentary predicates
    Marchenkov, S.S.
    Discrete Mathematics and Applications, 2000, 10 (06): : 571 - 585