A Continuous Model of Computation
- 1 May 1999
- journal article
- research article
- Published by AIP Publishing in Physics Today
- Vol. 52 (5) , 39-43
- https://doi.org/10.1063/1.882660
Abstract
A central dogma of computer science is that the Turing‐machine model is the appropriate abstraction of a digital computer.Physicists who've thought about the matter also seem to favor the Turing‐machine model. For example, Roger Penrose devoted some 60 pages of a book to a description of this abstract model of computation and its implications. I argue here that physicists should consider the real‐number model of computation as more appropriate and useful for scientific computation. Physicists should consider an alternative to the Turing‐machine model of computation.Keywords
This publication has 7 references indexed in Scilit:
- When Are Quasi-Monte Carlo Algorithms Efficient for High Dimensional Integrals?Journal of Complexity, 1998
- Faster Evaluation of Multidimensional IntegralsComputers in Physics, 1997
- On tractability of path integrationJournal of Mathematical Physics, 1996
- Multidimensional Quadrature AlgorithmsComputers in Physics, 1996
- Faster Valuation of Financial DerivativesThe Journal of Portfolio Management, 1995
- What is the complexity of ill-posed problems?Numerical Functional Analysis and Optimization, 1987
- On Computable Numbers, with an Application to the EntscheidungsproblemProceedings of the London Mathematical Society, 1937