Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-30T19:06:35.392Z Has data issue: false hasContentIssue false
  • English
  • Français

IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?

Published online by Cambridge University Press:  23 July 2002

KLAUS WEIHRAUCH  and
NING ZHONG
KLAUS WEIHRAUCH
Affiliation:
Department of Computer Science, FernUniversität Hagen, 58084 Hagen, Germany. [email protected]
NING ZHONG
Affiliation:
Department of Mathematics, Clermont College, University of Cincinnati, Batavia, OH 45103-1785, USA. [email protected]
Get access

Abstract

According to the Church-Turing Thesis a number function is computable by the mathematically defined Turing machine if and only if it is computable by a physical machine. In 1983 Pour-El and Richards defined a three-dimensional wave $u(t,x)$ such that the amplitude $u(0,x)$ at time 0 is computable and the amplitude $u(1,x)$ at time 1 is continuous but not computable. Therefore, there might be some kind of wave computer beating the Turing machine. By applying the framework of Type 2 Theory of Effectivity (TTE), in this paper we analyze computability of wave propagation. In particular, we prove that the wave propagator is computable on continuously differentiable waves, where one derivative is lost, and on waves from Sobolev spaces. Finally, we explain why the Pour-El-Richards result probably does not help to design a wave computer which beats the Turing machine.

2000 Mathematical Subject Classification: 03D80, 03F60, 35L05, 68Q05.

Keywords

computable analysiscomputable analysiswave equation
Type
Research Article
Information
Proceedings of the London Mathematical Society , Volume 85 , Issue 2 , September 2002 , pp. 312 - 332
Copyright
2002 London Mathematical Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)