Minds and Machines

, Volume 13, Issue 1, pp 79–85

Comments on `Two Undecidable Problems of Analysis'

  • Bruno Scarpellini

DOI: 10.1023/A:1021364916624

Cite this article as:
Scarpellini, B. Minds and Machines (2003) 13: 79. doi:10.1023/A:1021364916624


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 

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

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

Personalised recommendations