FOM: non-computable waves
Klaus.Weihrauch at FernUni-Hagen.de
Mon Aug 21 08:48:25 EDT 2000
Pour-El and Richards have defined a 3-dimensional wave
u(x,t) such that the amlitude u(x,0) at time 0 is computable and
the amlitude u(x,1) at time 1 is (continuous but) not computable
(in both cases computable real functions according
to Grzegorczyk's definition).
Can this theorem be used for designing a "wave computer"
which beats the Turing machine (i.e., computes a number function
which is not Turing computable)?
Probably many people have thought about it.
Is there a definitive satisfactory answer?
Name: Klaus Weihrauch
Position: Professor of Computer Science
Institution: Fernuniversitaet Hagen
Research interest: Computablity
More information: http://www.math.psu.edu/simpson/
More information about the FOM