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 条