The Legacy of Turing in Numerical Analysis
From MaRDI portal
Publication:2891357
DOI10.1007/978-3-642-27660-6_1zbMath1274.01074WikidataQ57733105 ScholiaQ57733105MaRDI QIDQ2891357
Publication date: 15 June 2012
Published in: SOFSEM 2012: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-27660-6_1
01A70: Biographies, obituaries, personalia, bibliographies
65-03: History of numerical analysis
68-03: History of computer science
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Fast linear homotopy to find approximate zeros of polynomial systems
- On a problem posed by Steve Smale
- Exotic quantifiers, complexity classes, and complete problems
- It is possible to know a problem instance is ill-posed? Some foundations for a general theory of condition numbers
- The real dimension problem is \(\text{NP}_{\mathbb R}\)-complete.
- Condition
- Smale’s 17th problem: Average polynomial time to compute affine and projective solutions
- Eigenvalues and Condition Numbers of Random Matrices
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Paths, Trees, and Flowers
- Some Comments from a Numerical Analyst
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Numerical inverting of matrices of high order
- ROUNDING-OFF ERRORS IN MATRIX PROCESSES
- Numerical Inverting of Matrices of High Order. II
