Abstract
In some problems of numerical analysis or optimization, we are faced with non-convergent sequences and have to obtain information from them (for examples see [23] , [24] , [26] , [30] and [37]). Sometimes we would like to know what kind of non-convergence it is, or how many accumulation points there are, or what the period is. In this chapter, we study this type of problem and try to determine what problems are decidable and what problems are not decidable.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
ABERT O. “Analysis in the computable number field” J.A.C.M., 15, 1968, pp. 275–299.
AZRA J.P. and JAULIN B. “Récursivité” GAUTHIER-VILLARS, Paris, 1973.
BASHUROV V.V. and OGIBIN V.N. “Conditions for the convergence of iterative processes on the real axis” U.S.S.R. Computational Math. and Math. Phys., 6,5, 1966 pp. 178–184.
BUTLER G.J. and PIANIGIANI G. “Periodic points and chaotic functions in the unit interval” Bull. Australian Math. Soc., 8, 1978.
CHU S.E. and MOYER R.D. “On continuous functions, commuting functions and fixed points” Fundamenta Mathematicae LIX 1966, pp. 91–95.
COPPEL W.A. “The solution of equations by iteration” Trans. Cambridge Phil. Soc., 51, 1955, pp. 41–43.
COSNARD M.Y. “On the behaviour of successive approximations” S.I.A.M. J. Numer. Anal., 16, 1979, pp. 300–310.
COSNARD M.Y. and EBERHARD A. “Sur les cycles d’une application continue de la variable réelle” Séminaire d’Analyse Numérique de Grenoble, n 274, 1977.
DAVIS M. “COMPUTABILITY AND UNSOLVABILITY” Mc Graw Hill, New-York, 1959.
DELAHAYE J.P. “Quelques problèmes posés par les suites de points non convergentes et algorithmes pour traiter de telles suites” Thèse de Sème Cycle, Lille, 1979.
DELAHAYE J.P. “Algorithmes-questions et algorithmes d’extraction pour suites non convergentes” Bulletin de la Direction des Etudes et Recherches de l’E.D.F., C, 1, 1979, pp. 17–34.
DELAHAYE J.P. “Expériences numériques sur les algorithmes d’extraction pour suites non convergentes” Publication ANO no 5, Université des Sciences et Techniques de Lille, 1979.
DELAHAYE J.P. “Algorithmes pour suites non convergentes” Humer. Math., 34, 1980, pp. 333–347.
DELAHAYE J.P. “Détermination de la période d’une suite pseudo-périodique Bulletin de la Direction des Etudes et Recherches de l’E.D.F., C, 1, 1980, pp. 65–80.
DELAHAYE J.P. “A counterexample concerning iteratively generated sequences” J.M.A.A., 75, 1980, pp. 236–241.
DELAHAYE J.P. “Cycles d’ordre 21 et convergence cyclique de la méthode des approximations successives” Publication ANO no 21, Université des Sciences et Techniques de Lille, 1980.
DELAHAYE J.P.Q “Functions admettant des cycles d’ordre n’importe quelle puissance de 2 et aucun autre cycle” C.R. Acad. Sc. Paris, 291, A, 1980, pp. 323–325.
DELAHAYE J.P. “The set of periodic points” The Amer. Math. Monthly, 88, 9, 1981, pp. 646–651.
DELAHAYE J.P. “Décidabilité et indécidabilité à la limite de certaine problèmes de suites” Séminaire d’Anbalyse Numérique de Grenoble, n° 360, 1981.
DELAHAYE J.P. “Algorithmes pour extraire une sous-suite convergente d’une suite non convergente” Proceeding of “Conference optimization. theory and algorithms”.Lecture notes in Pure and Applied Mathematics, 1983. Marcel Dekker.
DELAHAYE J.P. “The cluster point set of a non convergent sequence” Publications ANO no 68, Université des Sciences et Techniques de Lille, 1982.
DELAHAYE J.P. and GERMAIN-BONNE B. “Résultats négatifs en accélération de la convergence” Numer. Math., 35, 1980, pp. 443–457.
DENEL J. “Extensions of the continuity of point-to-set maps: applications to fixed point algorithms”, Mathematical Programming Study 10, 1979, pp. 48–68.
EAVES B.C. “Computing Kakutani Fixed Points” SIAM J. Appl. Math., 21, 1971, pp. 236–244.
FATEMAN R.J. “An algorithm for deciding the convergence of the rational iteration xna.1 = f(xn)” ACM Trans. on Math. Soft. 3, 1977, pp. 272–278.
FIOROT J.C. and HUARD P. “Composition and union of general algorithms of optimization” Mathematical Programming Study, 10, 1979, pp. 69–85.
GASTINEL N. “Introduction à l’analyse calculable” Cours polycopié de D.E.A., Grenoble, 1973.
GOLD E.M. “Limiting recursion” The Journal of Symbolic Logic., 30, 1965, pp. 28–48.
GOLD E.M. “Language identification in the limit” Information and Control 10, 1967, pp. 447–474.
HUARD P. “Optimisation dans Rn” Cours de D.E.A. polycopié, Université des Sciences et Techniques de Lille, 1972.
HUARD P. “Extensions of Zangwill’s Theorem” Mathematical Programming Study, 10, 1979, pp. 98–103.
KLUEDEN P.E. “Chaotic difference equations are dense” Bull. Austral. Math. Soc., 15, 1976, pp. 371–379.
LI T.Y. and YORKE J.A. “Period three implies chaos” The Ameri. Math., Monthly 82, 1975, pp. 985–992.
ROGERS H. “Recursive Functions and Effective Computability” Mc Graw Hill, New York, 1967.
SHARKOWSKII A.N. “Co-existence of the cycles of a continuous mapping of the line into itself” Ukrain. M.Z., 16, 1, 1964, pp. 61, 71.
TURING A.M. “On computable numbers, with an application to the entscheidunsproblem” Proc. London Math. Soc. 42, 1936–7, pp. 230–265.
ZANGWILL W.I. “Nonlinear programming: A unified approach” Prentice Hall, Englewood Cliffs, 1969.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Delahaye, JP. (1988). Decidability and Undecidability in the Limit. In: Sequence Transformations. Springer Series in Computational Mathematics, vol 11. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61347-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-61347-0_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64802-1
Online ISBN: 978-3-642-61347-0
eBook Packages: Springer Book Archive