ON A THEORY OF COMPUTATION AND COMPLEXITY OVER THE REAL NUMBERS - NP-COMPLETENESS, RECURSIVE FUNCTIONS AND UNIVERSAL MACHINES

被引：607

作者：

BLUM, L

SHUB, M

SMALE, S

机构：

[1] IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598

[2] UNIV CALIF BERKELEY,DEPT MATH,BERKELEY,CA 94720

来源：

关键词：

D O I：

10.1090/S0273-0979-1989-15750-9

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：1 / 46

页数：46

共 61 条

[1] Aho A.V, 1979, DESIGN ANAL COMPUTER
[2] [Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047
[3] ON THE REAL SPECTRUM OF A RING AND ITS APPLICATION TO SEMIALGEBRAIC GEOMETRY
BECKER, E
[J]. BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1986, 15 (01) : 19 - 60
[4] COMPLEX ANALYTIC DYNAMICS ON THE RIEMANN SPHERE
BLANCHARD, P
[J]. BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1984, 11 (01) : 85 - 141
[5] BORODIN A, 1982, LOGIC ALGORITHMIC MO, V30, P47
[6] INVRAIANT SETS UNDER ITERATION OF RATIONAL FUNCTIONS
BROLIN, H
[J]. ARKIV FOR MATEMATIK, 1965, 6 (02): : 103 - &
[7] Cutland N., 1980, COMPUTABILITY
[8] DAVIS M, 1963, J MATH, V7, P251
[9] DAVIS M, 1976, P S PURE MATH, V28, P323
[10] Davis M., 1982, COMPUTABILITY UNSOLV