Comments on `two undecidable problems of analysis'

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


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.



    Upload a copy of this work     Papers currently archived: 93,069

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Two undecidable problems of analysis.Bruno Scarpellini - 2003 - Minds and Machines 13 (1):49-77.
Two dogmas of computationalism.Oron Shagrir - 1997 - Minds and Machines 7 (3):321-44.
Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.
Church's thesis without tears.Fred Richman - 1983 - Journal of Symbolic Logic 48 (3):797-803.


Added to PP

45 (#363,753)

6 months
3 (#1,045,901)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

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

Add more citations

References found in this work

The emperor’s new mind.Roger Penrose - 1989 - Oxford University Press.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Theory of Formal Systems.Raymond M. Smullyan - 1965 - Journal of Symbolic Logic 30 (1):88-90.

Add more references