Mysteries of mathematics and computation (Q1323030): Difference between revisions

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.