Minds and Machines 13 (1):79-85 (2003)

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.
Keywords analogue computer  hypercomputation  neural computation  Turing machines  undecidability
Categories (categorize this paper)
Reprint years 2004
DOI 10.1023/A:1021364916624
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 51,668
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Undecidability Through Fourier Series.Peter Buser & Bruno Scarpellini - 2016 - Annals of Pure and Applied Logic 167 (7):507-524.

Add more citations

Similar books and articles


Added to PP index

Total views
34 ( #283,427 of 2,333,182 )

Recent downloads (6 months)
1 ( #587,885 of 2,333,182 )

How can I increase my downloads?


My notes