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 条
  • [31] Complexity limitations on quantum computation
    Fortnow, L
    Rogers, S
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1999, 59 (02) : 240 - 252
  • [32] Online Premeans and Their Computation Complexity
    Pasteczka, Pawel
    RESULTS IN MATHEMATICS, 2021, 76 (03)
  • [33] On the Iteration Complexity of Hypergradient Computation
    Grazzi, Riccardo
    Franceschi, Luca
    Pontil, Massimiliano
    Salzo, Saverio
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 119, 2020, 119
  • [34] MATHEMATICAL APPLICATIONS, COMPUTATION, AND COMPLEXITY
    COHEN, H
    QUARTERLY OF APPLIED MATHEMATICS, 1972, 30 (01) : 109 - &
  • [35] Online Premeans and Their Computation Complexity
    Paweł Pasteczka
    Results in Mathematics, 2021, 76
  • [36] SPACE COMPLEXITY IN ONLINE COMPUTATION
    MACHIDA, H
    KASAI, T
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1982, 24 (03) : 362 - 372
  • [37] Information, computation, and complexity in economics
    Ooomes, N.A.
    Neural Network World, 1998, 8 (03): : 299 - 328
  • [38] Complexity of the computation of linear projections
    Bermejo, I
    Lejeune-Jalabert, M
    COMMUNICATIONS IN ALGEBRA, 1999, 27 (07) : 3211 - 3220
  • [39] On supersymmetry breaking in the computation of the complexity
    Parisi, G
    Rizzo, T
    JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 2004, 37 (33): : 7979 - 7992
  • [40] The Communication Complexity of Payment Computation
    Dobzinski, Shahar
    Ron, Shiri
    STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2021, : 933 - 946