Complexity and real computation: A manifesto

International Journal of Bifurcation and Chaos in Applied Sciences and Engineering

Volumn 6, Issue 1, 1996, Pages 3-26

  Blum, Lenore ^a   Cucker, Felipe ^b   Shub, Mike ^c   Smale, Steve ^d  

^a INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^b UNIVERSITAT POMPEU FABRA   (Spain)

^c IBM T J WATSON RESEARCH CENTER   (United States)

^d CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0029681225     PISSN: 02181274     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218127496001818     Document Type: Article

References (115)

1. Abramson, F. [1971] "Effective computation over the real numbers," in 12th Annual IEEE Symp. on Switching and Automata Theory, pp. 33-37.
2. Aho, A., Hopcroft, J. & Ullman, J. [1974] The Design and Analysis of Computer Algorithms (Addison-Wesley).
3. Balcázar, J., Díaz, J. & Gabarró, J. [1988] Structural Complexity I, EATCS Monographs on Theoretical Computer Science, Vol. 11 (Springer-Verlag).
4. Balcázar, J., Díaz, J. & Gabarró, J. [1990] Structural Complexity II, EATCS Monographs on Theoretical Computer Science, Vol. 22 (Springer-Verlag).
5. Ben-Or, M. [1983] "Lower bounds for algebraic computation trees," in 15th Annual ACM Symp. on the Theory of Computing, pp. 80-86.
6. Ben-Or, M., Kozen, D. & Reif, J. [1986] "The complexity of elementary algebra and geometry," J. of Computer and Systems Sciences 18, 251-264.
7. Benedetti, R. & Risler, J.-J. [1990] Real Algebraic and Semi-Algebraic Sets (Hermann).
8. Blum, L. [1990] "Lectures on a theory of computation and complexity over the reals (or an arbitrary ring)," in Lectures in the Sciences of Complexity II, ed., E. Jen (Addison-Wesley), pp. 1-47.
9. Blum, L. [1991] "A theory of computation and complexity over the real numbers," in Proc. of the Int. Congress of Mathematicians (Springer-Verlag), pp. 1491-1507.
10. Blum, L., Shub, M. & Smale, S. [1989] "On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines," Bulletin of the Amer. Math. Soc. 21, 1-46.
11. Blum, L. & Smale, S. [1993] "The Gödel incompleteness theorem and decidability over a ring," in From Topology to Computation: Proc. of the Smalefest, eds. Hirsch, M., Marsden, J. & Shub, M. (Springer-Verlag), pp. 321-339.
12. Blum, M. [1967] "A machine-independent theory of the complexity of recursive functions," J. ACM 14, 322-336.
13. Bochnak, J., Coste, M. & Roy, M.-F. [1987] Géométrie algébrique réelle (Springer-Verlag).
14. Borodin, A. & I. Munro [1975] The Computational Complexity of Algebraic and Numeric Problems (Elsevier).
15. Brownawell, W. [1987] "Bounds for the degrees in the Nullstellensatz," Annals Math. 126, 577-591.
16. Caniglia, L., Galligo, A. & Heintz, J. [1988] "Borne simple exponentielle pour les degrés dans les théorèmes de zéros sur un corps de caractéristique quelconque," C. R. Acad. Sci. Paris 307, 255-258.
17. Canny, J. [1988] "Some algebraic and geometric computations in PSPACE," in 20th Annual ACM Symp. on the Theory of Computing, pp. 460-467.
18. Church, A. [1936] "An unsolvable problem of elementary number theory," Amer. J. of Math. 58, 354-363.
19. Cobham, A. [1964] "The intrinsic computational difficulty of problems," in Int. Congress for Logic, Methodology, and the Philosophy of Science, ed. Bar-Hillel, Y. (North-Holland), pp. 24-30.
20. Collins, G. [1975] Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Deccomposition, Vol. 33 of Lecture Notes in Computer Science (Springer-Verlag), pp. 134-183.
21. Cook, S. [1971] "The complexity of theorem proving procedures," in 3rd Annual ACM Symp. on the Theory of Computing, pp. 151-158.
22. Cucker, F. [1992a] "The arithmetical hierarchy over the reals," J. of Logic and Computation 2, 375-395.
23. ℝ" J. of Complexity 8, 230-238.
24. Cucker, F. [1993] "On the complexity of quantifier elimination: The structural approach," The Computer Journal 36, 400-408.
25. Cutland, N. [1980] Computability (Cambridge University Press).
26. Davis, M. [1965] The Undecidable (Raven Press).
27. Devaney, R. [1989] Chaotic Dynamical Systems (Addison-Wesley).
28. Edmonds, J. [1965] "Paths, trees, and flowers," Canadian J. of Math. 17, 449-467.
29. Engeler, E. [1967] "Algorithmic properties of structures," Maths. Systems Theory 1, 183-195.
30. Engeler, E. [1993] Algorithmic Properties of Structures (World Scientific).
31. Engeler, E. in collaboration with Aberer, K., Amrhein, B., Gloor, O., von Mohrenschildt, M., Otth, D., Schwätrzler, G. & Weibel, T. [1995] The Combinatory Programme (Birkhauser).
32. Friedman, H. [1971] "Algorithmic procedures, generalized turing algorithms, and elementary recursion theory," in Logic Colloquium 1969, eds. Gandy, R. & Yates, C. M. E. (North-Holland), pp. 361-390.
33. Friedman, H. & Ko, K. [1982] "Computational complexity of real functions," Theoretical Computer Sci. 20, 323-352.
34. Friedman, H. & Mansfield, R. [1992] "Algorithmic procedures," Trans. of the Amer. Math. Soc. 332, 297-312.
35. Garey, M. & Johnson, D. [1979] Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman).
36. Goldstine, H. [1977] A History of Numerical Analysis from the 16th through the 19th Century (Springer-Verlag).
37. Grigoriev, D. & Vorobjov, N. [1988] "Solving systems of polynomial inequalities in subexponential time," J. of Symbolic Computation 5, 37-64.
38. Harrington, L., Morley, M., Seedrov, A. & Simpson, S. (eds.) [1985] Harvey Friedman's Research on the Foundations of Mathematics (North-Holland).
39. Hartmanis, J. & Stearns, R. [1965] On the computational complexity of algorithms," Trans. of the Amer, Math. Soc. 117, 285-306.
40. Hartshorne, R. [1977] Algebraic Geometry (Springer-Verlag).
41. Heintz, J., Roy, M.-F. & Solerno, P. [1990] Sur la complexité du principe de Tarski-Seidenberg," Bulletin de la Société Mathématique de France 118, 101-126.
42. Herman, G. & Isard, S. [1970] "Computability over arbitrary fields," J. London Math. Soc. 2, 73-79.
43. Hermann, G. [1926] "Die Frage der endlich vielen Schritte in der Theorie der Polynomideale," Math. Ann. 95, 736-788.
44. Hirsch, M., Marsden, J. & Shub, M. (eds.) [1993] From Topology to Computation: Proceedings of the Smalefest (Springer-Verlag).
45. Hoover, H. [1987] "Feasibly constructive analysis," Ph.D. Thesis, Department of Computer Science, University of Toronto.
46. Karp, R. [1972] "Reducibility among combinatorial problems," in Complexity of Computer Computations, eds. Miller, R. & Thatcher, J. (Plenum Press), pp. 85-103.
47. Kendig, K. [1977] Elementary Algebraic Geometry (Springer-Verlag).
48. Kleene, S. [1936] "General recursive functions of natural numbers," Math. Annalen 112, 727-742.
49. Ko, K. [1991] Complexity Theory of Real Functions (Birkhäuser).
50. Koiran, P. [1993] "A weak version of the Blum, Shub & Smale model," in 34th Annual IEEE Symp. on Foundations of Computer Science, pp. 486-495.
51. Kollár, J. [1988] "Sharp effective Nullstellensatz," J. of Amer. Math. Soc. 1, 963-975.
52. Kreitz, C. & Weihrauch, K. [1982] "Complexity theory of real numbers and functions," in Theoretical Computer Science, eds. Cremers, A. & Kreigel, H. vol. 145, Lecture Notes in Computer Science (Springer-Verlag), pp. 165-174.
53. Kreitz, C. & Weihrauch, K. [1982] "Complexity theory of real numbers and functions," in Theoretical Computer Science, eds. Cremers, A. & Kreigel, H. vol. 145, Lecture Notes in Computer Science (Springer-Verlag), pp. 165-174.
54. Kuhn, T. [1957] The Copernican Revolution: Planetary Astronomy in the Development of the Western Thought (Harvard University Press).
55. Lang, S. [1993] Algebra 3rd edn. (Addison-Wesley).
56. Levin, L. [1973] "Universal sequential search problems," Probl. Pered. Inform. IX 3, 265-266. (in Russian, English translation in Problems of Information Trans. 9(3); corrected translation in Trakhtenbrot [1984]).
57. Levin, L. [1973] "Universal sequential search problems," Probl. Pered. Inform. IX 3, 265-266. (in Russian, English translation in Problems of Information Trans. 9(3); corrected translation in Trakhtenbrot [1984]).
58. Matiyasevich, Y. [1993] Hilbert's Tenth Problem (MIT Press).
59. Meer, K. [1990] "Computations over ℤ and ℝ: A comparison," J. of Complexity 6, 256-263.
60. Meer, K. [1992] "A note on a P ≠ NP result for a restricted class of real machines," J. of Complexity 8, 451-453.
61. Meer, K. [1993] "Real number models under various sets of operations," J. of Complexity 9, 366-372.
62. Meer, K. [1994] "On the complexity of quadratic programming in real number models of computation," Theoretical Computer Sci. 133, 85-94.
63. Michaux, C. [1989] "Une remarque à propos des machines sur ℝ introduites par Blum, Shub et Smale," C. R. Acad. Sci. Paris 309, Série I, 435-437.
64. Michaux, C. [1991] "Ordered rings over which output sets are recursively enumerable," Proc. Amer. Math. Soc. 112, 569-575.
65. Moschovakis, Y. [1986] Foundations of the theory of algorithms, Draft.
66. Ostrowski, A. [1954] "On two problems in abstract algebra connected with Horner's rule," in Studies in Mathematics and Mechanics presented to Richard von Mises (Academic Press), pp. 40-48.
67. Pan, V. [1966] "Methods of computing values of polynomials," Russian Math. Surveys 21, 105-136.
68. Pan, V. [1987] "Sequential and parallel complexity of approximate evaluation of polynomial zeros," Comput. Math. Appl. 14, 591-622.
69. Pan, V. [1995] "Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros," in 27th Annual ACM Symp. on the Theory of Computing, pp. 741-750.
70. Papadimitriou, C. [1994] Computational Complexity (Addison-Wesley).
71. Peitgen, H.-O. & Saupe, D. (eds.) [1988] The Science of Fractal Images (Springer-Verlag).
72. Penrose, R. [1991] The Emperor's New Mind (Penguin Books).
73. Poizat, B. [1995] Les Petits Cailloux (Aléa).
74. Post, E. [1943] "Formal reductions of the general combinatorial decision problem," Amer. J. Math. 65, 197-268.
75. Pour-El, M. & Richards, I. [1983] "Computability and noncomputability in classical analysis," Trans. of the Amer. Math. Soc. 275, 539-560.
76. Preparata, F. & Shamos, M. [1985] Computational Geometry: An Introduction, Texts and Monographs in Computer Science (Springer-Verlag).
77. Rabin, M. [1960a] "Computable algebra, general theory and theory of computable fields," Trans. of the Amer. Math. Soc. 95, 341-360.
78. Rabin, M. [1960b] "Degree of difficulty of computing a function and a partial ordering of recursive sets," Tech. Rep. 2, Hebrew University of Jerusalem.
79. Rabin, M. [1966] "Mathematical theory of automata," in 19th ACM Symp. in Applied Mathematics, pp. 153-175.
80. Renegar, J. [1987] "On the efficiency of Newton's method in approximating all zeros of systems of complex polynomials," Math. of Oper. Research 12, 121-148.
81. Renegar, J. [1992] "On the computational complexity and geometry of the first-order theory of the reals. Part I," J. of Symbolic Computation 13, 255-299.
82. Rogers, H. [1967] Theory of Recursive Functions and Effective Computability (McGraw-Hill).
83. Scholz, A. [1937] "Aufgabe 253," Jahresber. Deutsch. Math.-Verein. 47, 41-42.
84. Schönhage, A. [1982] "The fundamental theorem of algebra in terms of computational complexity," Tech. Rep., Math. Institut der. Univ. Tübingen.
85. Schrijver, A. [1986] Theory of Linear and Integer Programming (John Wiley & Sons).
86. Shafarevich, I. [1977] Basic Algebraic Geometry (Springer-Verlag).
87. Shepherdson, J. & Sturgis, H. [1963] "Computability of recursive functions," J. of the ACM 10, 217-255.
88. Shub, M. & Smale, S. [1993a] "Complexity of Bezout's theorem I: Geometric aspects," J. of the Amer. Math. Soc. 6, 459-501.
89. Shub, M. & Smale, S. [1993b] "Complexity of Bezout's theorem II: Volumes and probabilities," in Computational Algebraic Geometry, eds. Eyssette, F. & Galligo, A., vol. 109 Progress in Mathematics (Birkhäuser), pp. 267-285.
90. Shub, M. & Smale, S. [1993b] "Complexity of Bezout's theorem II: Volumes and probabilities," in Computational Algebraic Geometry, eds. Eyssette, F. & Galligo, A., vol. 109 Progress in Mathematics (Birkhäuser), pp. 267-285.
91. Shub, M. & Smale, S. [1993c] "Complexity of Bezout's theorem III: Condition number and packing," J. of Complexity 9, 4-14.
92. Shub, M. & Smale, S. [1993d] "Complexity of Bezout's theorem IV: Probability of success, extensions," to appear in SIAM J. of Numer. Anal.
93. Shub, M. & Smale, S. [1994] "Complexity of Bezout's theorem V: Polynomial time," Theoretical Computer Sci. 133, 141-164.
94. Sipser, M. [1992] "The History and Status of the P versus NP Question," in 24th Annual ACM Symp. on the Theory of Computing, pp. 603-618.
95. Smale, S. [1985] "On the efficiency of algorithms of analysis," Bulletin of the Amer. Math. Soc. 13, 87-121.
96. Smale, S. [1987] "On the topology of algorithms I," J. of Complexity 3, 81-89.
97. Smale, S. [1988] "The Newtonian contribution to our understanding of the computer," in Newton's Dream, ed. Stayer, M. (McGill-Queens University Press).
98. Smale, S. [1990] "Some remarks on the foundations of numerical analysis," SIAM Rev. 32, 211-220.
99. Steele, J. & Yao, A. [1982] "Lower bounds for algebraic decision trees," J. of Algorithms 3, 1-8.
100. Straßen, V. [1969] "Gaussian elimination is not optimal," Numer. Math. 13, 354-356.
101. Straßen, V. [1990] "Algebraic complexity theory," in Handbook of Theoretical Computer Science, ed., van Leeuwen, J., vol. A (MIT Press/Elsevier), pp. 633-672.
102. Tarski, A. [1951] A Decision Method for Elementary Algebra and Geometry (University of California Press).
103. Trakhtenbrot, B. [1984] "A survey of Russian approaches to perebor (brute-force search) algorithms," Annals of the History of Computing 6, 384-400.
104. Traub, J., Wasilkowski, G. & Wozniakowski, H. [1988] Information-Based Complexity (Academic Press).
105. Tucker, J. [1980] "Computing in algebraic systems," in Recursion Theory, its Generalizations and Applications, eds. Drake, F. & Wainer, S. London Math. Soc. (Cambridge University Press).
106. Tucker, J. & Zucker, J. [1992] "Examples of semicomputable sets of real and complex numbers," in Constructivity in Computer Science, eds. O'Donnell, M. & Myers Jr, J., vol. 613, Lecture Notes in Computer Science (Springer-Verlag), pp. 179-198.
107. Tucker, J. & Zucker, J. [1992] "Examples of semicomputable sets of real and complex numbers," in Constructivity in Computer Science, eds. O'Donnell, M. & Myers Jr, J., vol. 613, Lecture Notes in Computer Science (Springer-Verlag), pp. 179-198.
108. Turing, A. [1936] "On computable numbers, with an application to the Entscheidungsproblem," Proc. London Math. Soc. Ser. 2, 42, 230-265.
109. Tyurin, J. [1979] "A survey of the logic of effective definitions," in Logic of Programs, ed. Engeler, E., vol. 125, Lecture Notes in Computer Science (Springer-Verlag), pp. 198-245.
110. Tyurin, J. [1979] "A survey of the logic of effective definitions," in Logic of Programs, ed. Engeler, E., vol. 125, Lecture Notes in Computer Science (Springer-Verlag), pp. 198-245.
111. Van der Waerden, B. [1949] Modern Algebra (F. Ungar Publishing Co.).
112. von Neumann, J. [1963] Collected Works V, ed. Taub, A. (MacMillan).
113. Weihrauch, K. [1987] Computability, EATCS Monographs on Theoretical Computer Science, vol. 9 (Springer-Verlag).
114. Winograd, S. [1967] "On the number of multiplications required to compute certain functions," Proc. National Acad. Sci. 58, 1840-1842.
115. Winograd, S. [1980] "Arithmetic complexity of computations," SIAM Reginal Conf. Ser. Appl. Math. 33.