The Legacy of Turing in Numerical Analysis

@inproceedings{Cucker2012TheLO,
  title={The Legacy of Turing in Numerical Analysis},
  author={F. Cucker},
  booktitle={SOFSEM},
  year={2012}
}
  • F. Cucker
  • Published in SOFSEM 2012
  • Computer Science
  • 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… CONTINUE READING
    3 Citations
    A personal account of Turing's imprint on the development of computer science
    • 1
    • PDF
    A Bibliography of Publications of Alan Mathison Turing
    • 1
    • PDF

    References

    SHOWING 1-10 OF 21 REFERENCES
    On a theory of computation and complexity over the real numbers: $NP$- completeness, recursive functions and universal machines
    • 1,037
    • Highly Influential
    • PDF
    The complexity of theorem-proving procedures
    • S. Cook
    • Mathematics, Computer Science
    • STOC '71
    • 1971
    • 6,152
    • PDF
    Some Comments from a Numerical Analyst
    • 37
    • PDF
    Mathematical problems for the next century
    • 1,000
    • PDF
    On Computable Numbers, with an Application to the Entscheidungsproblem
    • 7,275
    • PDF
    Exotic Quantifiers, Complexity Classes, and Complete Problems
    • 11
    • PDF
    On a problem posed by Steve Smale
    • 61
    • PDF
    Complexity and Real Computation
    • L. Blum
    • Mathematics, Computer Science
    • Springer New York
    • 1998
    • 1,415
    • PDF
    Fast Linear Homotopy to Find Approximate Zeros of Polynomial Systems
    • 56
    • PDF
    A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms
    • 211
    • PDF