Comments on `Two Undecidable Problems of Analysis'
- Bruno ScarpelliniAffiliated withMathematics Institute, University of Basel
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
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.
- Comments on `Two Undecidable Problems of Analysis'
Minds and Machines
Volume 13, Issue 1 , pp 79-85
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- analogue computer
- neural computation
- Turing machines
- Author Affiliations
- 1. Mathematics Institute, University of Basel, Rheinsprung 21, 4051, Basel, Switzerland