Mysteries of mathematics and computation

DOI10.1007/BF03026609zbMath0806.68037OpenAlexW2002695781MaRDI QIDQ1323030

Michael Shub

Publication date: 10 May 1994

Published in: The Mathematical Intelligencer (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03026609

zbMATH Keywords

Turing's universal machine

Mathematics Subject Classification ID

Related Items (1)

Graphic and numerical comparison between iterative methods

Cites Work

• On condition numbers and the distance to the nearest ill-posed problem
• Complexity of Bezout's theorem. III: Condition number and packing
• The Probability That a Numerical Analysis Problem is Difficult
• Complexity of Bezout's Theorem I: Geometric Aspects
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Reducibility among Combinatorial Problems
• The complexity of theorem-proving procedures
• On the average number of real roots of a random algebraic equation
• A logical calculus of the ideas immanent in nervous activity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Mysteries of mathematics and computation