Minds and Machines

, Volume 13, Issue 1, pp 79–85 | Cite as

Comments on `Two Undecidable Problems of Analysis'

  • Bruno Scarpellini
Article

Abstract

We first discuss some technical questions which arise in connection with the construction of undecidable propositions in analysis, in particular in connection with the notion of the normal form of a function representing a predicate. Then it is stressed that while a function f(x) may be computable in the sense of recursive function theory, it may nevertheless have undecidable properties in the realm of Fourier analysis. This has an implication for a conjecture of Penrose's which states that classical physics is computable.

analogue computer hypercomputation neural computation Turing machines undecidability 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Buser, P. (1972), Darstellung von Prädikaten durch analytische Funktionen, Diplomarbeit, Universität Basel, pp. 1–41.Google Scholar
  2. da Costa, A. and Doria, A. (1991a), Undecidability and Incompleteness in Classical Mechanics, Int. J. Theoret. Phys. 30(8), pp. 1041–1073.Google Scholar
  3. da Costa, A. and Doria, A. (1991b), Classical Physics and Penroses Thesis, Found. of Phys. Letters 4(4), pp. 343–373.Google Scholar
  4. Davis, M. (1958), Computability and Unsolvability, New York: McGraw-Hill.Google Scholar
  5. Hancock, H. (1958), Theory of Elliptic Functions, Dover Publishing.Google Scholar
  6. Matijasevich, J. (1970), 'Enumerable Sets are Diophantine', Soviet Math. Doklady 11, pp. 354–357.Google Scholar
  7. Penrose, R. (1989), The Emperors New Mind, Oxford: Oxford University Press.Google Scholar
  8. Pour-El, M. and Richards, I. (1981), 'The Wave Equation with Computable Initial Data Such That Its Unique Solution Is Not Computable', Advances in Math. 39, pp. 215–239.Google Scholar
  9. Smullyan, R. (1961), Theory of Formal Systems, Princeton, NJ: Princeton University Press.Google Scholar
  10. Golubitsky, M. and Schaeffer, D. (1985), Singularities and Groups in Bifurcation Theory, NewYork: Springer.Google Scholar

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • Bruno Scarpellini
    • 1
  1. 1.Mathematics InstituteUniversity of BaselBaselSwitzerland

Personalised recommendations