EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 19 / No 1 (1985) RAIRO. Inform. théor., 19 1 (1985) 3-20 References
Free Access
Issue
RAIRO. Inform. théor.
Volume 19, Number 1, 1985
Page(s) 3 - 20
DOI https://doi.org/10.1051/ita/1985190100031
Published online 01 February 2017
  1. 1. O. ABERTH, Analysis in the computable number field, J.A.C.M., vol. 15, n° 2, April 1968, p. 275-299. [MR: 237337] [Zbl: 0159.01201] [Google Scholar]
  2. 2. A. ARNOLD et M. NIVAT, Metric interpretations of infinite trees and semantic of non deterministic recursive programs, Theoretical Computer Science, vol. 11, 1980, p. 181-205. [MR: 572215] [Zbl: 0427.68022] [Google Scholar]
  3. 3. L. BLUM et M. BLUM, Toward a mathematical theory of induetive inference information and control, vol. 28, 1975, p. 125-155. [MR: 395312] [Zbl: 0375.02028] [Google Scholar]
  4. 4. L. BOASSON et M. NIVAT, Adhérences of languages, Journal of Computer and System Science, vol. 20, 1980, p. 285-309. [MR: 584863] [Zbl: 0471.68052] [Google Scholar]
  5. 5. C. BREZINSKI, Accélération de la convergence en analyse numérique, Lecture notes in Mathematics, vol. 584, Springer Verlag, Heidelberg, 1977. [MR: 455266] [Zbl: 0352.65003] [Google Scholar]
  6. 6. C. BREZINSKI, Algorithmes d'accélération de la convergence. Étude numérique Technip, Paris, 1978. [MR: 511657] [Zbl: 0396.65001] [Google Scholar]
  7. 7. G. COMYN, Objets infinis calculables, Thèse d'État, Lille, 1982. [Google Scholar]
  8. 8. G. COMYN et M. DAUCHET, Metric approximations in ordered domains, Équipe Lilloise d'Informatique Théorique, I.T., n° 59, octobre 1983. Université de Lille-I. [Google Scholar]
  9. 9. G. COMYN et M. DAUCHET, Approximation of infinitary objects, Ninth Colloquium ICALP, Lecture Notes in Computer Science. Springer Verlag, vol. 140, 1982, p. 116-127. [MR: 675450] [Zbl: 0505.03013] [Google Scholar]
  10. 10. J.-P DELAHAYE, Algorithmes pour suites non convergentes, Numer. math., vol.3, 1980, p.333-347. [EuDML: 132676] [MR: 571293] [Zbl: 0411.65003] [Google Scholar]
  11. 11. J.-P DELAHAY, Automatic selection of sequences transformations, Mathematics of computation, vol. 37, 1981, p. 197-204. [MR: 616372] [Zbl: 0468.65001] [Google Scholar]
  12. 12. J.-P. DELAHAYE, Optimalité du procédé ∆2 d'Aitken pour l'accélération de la convergence linéaire, R.A.I.R.O., Analyse numérique, vol. 15, 1981, p. 321-330. [EuDML: 193385] [Zbl: 0468.65002] [Google Scholar]
  13. 13. J.-P. DELAHAYE, Théorie des transformations de suites en analyse numérique, Applications thèse d'État, Lille, 1982. [Google Scholar]
  14. 14. J.-P. DELAHAYE et B. GERMAIN-BONNE, Résultats négatifs en accélération de la convergenceNumér. Math., vol. 35, 1980, p. 443-457. [EuDML: 186301] [MR: 593838] [Zbl: 0423.65003] [Google Scholar]
  15. 15. J.-P. DELAHAYE et B. GERMAIN-BONNE, The set of lagarithmically convergent sequences cannot be accelerated, S.I.A.M. J. Num. Anal., vol. 1982, p. 840-844. [MR: 664889] [Zbl: 0495.65001] [Google Scholar]
  16. 16. E. M. GOLD, Limiting recursion, The Journal of symbolic logic, vol. 30, 1965, p. 28-48. [MR: 239972] [Zbl: 0203.01201] [Google Scholar]
  17. 17. E. M. GOLD, Language identification in the limit, Information and control, vol. 10, 1967, p. 447-474. [Zbl: 0259.68032] [Google Scholar]
  18. 18. E. MINICOZZI, Some natural properties of strong identification in inductive inference, Theoretical Computer Science, vol. 2, 1976, p. 345-360. [MR: 505370] [Zbl: 0373.68051] [Google Scholar]
  19. 19. M. NIVAT, Infinite words, infinite trees, infinite computations, Foundations of Computer Science III. Part. 2 Languages, logic, semantics, J. W. De Bakker (Ed.), J. Van Leeuwen (Ed.), Mathematical Centre Tract, 1979, p. 1-52. [MR: 560292] [Zbl: 0423.68012] [Google Scholar]
  20. 20. H. ROGERS, Recursive functions and effective computability, McGraw Hill, New York, 1967. [MR: 224462] [Zbl: 0183.01401] [Google Scholar]
  21. 21. L. SCHWARTZ, Analyse. Topologie générale et analyse fonctionnelle, Hermann, Paris, 1970. [MR: 467223] [Zbl: 0424.46010] [Google Scholar]
  22. 22. E. WIEDMER, Computing with infinite objects, Theoretical Computer Science vol. 10, 1980, p. 133-155. [MR: 551601] [Zbl: 0473.68042] [Google Scholar]
  23. 23. J. WIMP, Sequence transformations and their applications, Academic press, New York, 1981. [MR: 615250] [Zbl: 0566.47018] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.