Is wave propagation computable or can wave computers beat the Turing machine? (2002)
by
Klaus Weihrauch
,
Ning Zhong
| Venue: | PROC. LONDON MATH SOC |
| Citations: | 16 - 2 self |
BibTeX
@INPROCEEDINGS{Weihrauch02iswave,
author = {Klaus Weihrauch and Ning Zhong},
title = {Is wave propagation computable or can wave computers beat the Turing machine?},
booktitle = {PROC. LONDON MATH SOC},
year = {2002},
pages = {312--332},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
By the Church-Turing Thesis a numerical function is computable by a physical device if and only if it is computable by a Turing machine. The `if'-part is plausible since every (sufficiently small) Turing machine can be simulated by a computer program which operates correctly as long as sufficient time and storage
