Mysteries of mathematics and computation
type: Item
instance of: scholarly article
title: Mysteries of mathematics and computation
zbMATH Open document ID: 0806.68037
DOI: 10.1007/BF03026609
author: Michael Shub
published in: The Mathematical Intelligencer
publication date: 1994-05-10T00:00:00Z
review text: This article discusses theory and practice in computer science, from a new theory of complexity and computability more suited to scientific computation to the difficulties of tracing ideas from theory into practice. The immediate relevance of Turing's universal machine to the first American stored program machines is called into question.
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 566360
zbMATH Keywords: Turing's universal machine
MaRDI profile type: Publication
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: The complexity of theorem-proving procedures
cites work: Reducibility among Combinatorial Problems
cites work: Q4198056
cites work: Complexity of Bezout's Theorem I: Geometric Aspects
cites work: Q3135179
cites work: Complexity of Bezout's theorem. III: Condition number and packing
cites work: Q4279734
cites work: On condition numbers and the distance to the nearest ill-posed problem
cites work: The Probability That a Numerical Analysis Problem is Difficult
cites work: Q4279732
cites work: On the average number of real roots of a random algebraic equation
cites work: A logical calculus of the ideas immanent in nervous activity
cites work: Q5656731
cites work: Q3327698
full work available at URL: https://doi.org/10.1007/bf03026609
OpenAlex ID: W2002695781
description: scientific article; zbMATH DE number 566360