Comments on 'two undecidable problems of analysis'

Minds and Machines

Volumn 13, Issue 1, 2003, Pages 79-85

  Scarpellini, Bruno ^a  

^a UNIVERSITY OF BASEL   (Switzerland)

Author keywords

Analogue computer; Hypercomputation; Neural computation; Turing machines; Undecidability

Indexed keywords

ANALOG COMPUTERS; FORMAL LOGIC; FUNCTION EVALUATION; INTEGRAL EQUATIONS; MATHEMATICAL MODELS; ORDINARY DIFFERENTIAL EQUATIONS; PARTIAL DIFFERENTIAL EQUATIONS; PROBLEM SOLVING; RECURSIVE FUNCTIONS; TURING MACHINES;

HYPERCOMPUTATION; NEURAL COMPUTATION; UNDECIDABILITY;

COMPUTABILITY AND DECIDABILITY;

EID: 0037314840     PISSN: 09246495     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021364916624     Document Type: Note

References (10)

1. Buser, P. (1972), Darstellung Von Prädikaten durch analytische Funktionen, Diplomarbeit, Universität Basel, pp. 1-41.
2. da Costa, A. and Doria, A. (1991a), Undecidability and Incompleteness in Classical Mechanics, Int. J. Theoret. Phys. 30(8), pp. 1041-1073.
3. da Costa, A. and Doria, A. (1991b), Classical Physics and Penroses Thesis. Found. of Phys. Letters 4(4), pp. 343-373.
4. Davis, M. (1958), Computability and Unsolvability, New York: McGraw-Hill.
5. Hancock, H. (1958), Theory of Elliptic Functions, Dover Publishing.
6. Matijasevich, J. (1970), 'Enumerable Sets are Diophantine', Soviet Math. Doklady 11, pp. 354-357.
7. Penrose, R. (1989), The Emperors New Mind, Oxford: Oxford University Press.
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.
9. Smullyan, R. (1961), Theory of Formal Systems, Princeton, NJ: Princeton University Press.
10. Golubitsky, M. and Schaeffer, D. (1985), Singularities and Groups in Bifurcation Theory, New York: Springer.