The legacy of turing in numerical analysis

Authors:
Felipe Cucker
Affiliations:
Department of Mathematics, City University of Hong Kong, Hong Kong, P.R. of China
Venue:
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Year:
2012

Citing 9
Cited 0

Eigenvalues and condition numbers of random matrices

SIAM Journal on Matrix Analysis and Applications
Is it possible to know a problem instance is ill-posed?: some foundations for a general theory of condition numbers

Journal of Complexity
Complexity and real computation

Complexity and real computation
The real dimension problem is NPR -complete

Journal of Complexity
Some Comments from a Numerical Analyst

Journal of the ACM (JACM)
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms

IEEE Annals of the History of Computing
Exotic Quantifiers, Complexity Classes, and Complete Problems

Foundations of Computational Mathematics
Fast Linear Homotopy to Find Approximate Zeros of Polynomial Systems

Foundations of Computational Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Alan Mathison Turing is revered among computer scientists for laying down the foundations of theoretical computer science via the introduction of the Turing machine, an abstract model of computation upon which, an elegant notion of cost and a theory of complexity can be developed. In this paper we argue that the contribution of Turing to "the other side of computer science", namely the domain of numerical computations as pioneered by Newton, Gauss, &c, and carried out today in the name of numerical analysis, is of an equally foundational nature.