Hostname: page-component-586b7cd67f-dsjbd Total loading time: 0 Render date: 2024-11-28T16:20:39.506Z Has data issue: false hasContentIssue false
  • English
  • Français

Algorithms and Programs

Published online by Cambridge University Press:  09 February 2016

Kurt Mehlhorn
Kurt Mehlhorn*
Affiliation:
Max-Planck-Institut für Informatik, 66123 Saarbrücken, Germany. E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

This article is based on the Erasmus Lecture that I delivered at the 2014 Annual Meeting of the Academia Europaea in Barcelona. I will discuss my early fascination for the field, as well as algorithms, programs, laws of computation, the double role of informatics as a mathematical and engineering discipline, and my effort to teach informatics to non-majors and the general public.

Type
Erasmus Lecture 2014
Information
European Review , Volume 24 , Issue 1 , February 2016 , pp. 4 - 16
Copyright
© Academia Europaea 2016 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.van Wijngaarden, A., Mailloux, B. J., Peck, J. E. L. and Koster, C. H. A. (1969) Report on the algorithmic language 68. Numerische Mathematik, 14, pp. 79–218.Google Scholar
2.Kettner, L., Mehlhorn, K., Pion, S., Schirra, S. and Yap, C. (2008) Classroom examples of robustness problems in geometric computations. Computational Geometry: Theory and Applications (CGTA), 40, pp. 61–78. A preliminary version appeared in ESA 2004, LNCS 3221, pp. 702 – 713.CrossRefGoogle Scholar
3.Mehlhorn, K. and Näher, S. (1999) The LEDA Platform for Combinatorial and Geometric Computing (Cambridge: Cambridge University Press).Google Scholar
4.Blum, M. and Kannan, S. (1995) Designing programs that check their work. Journal of ACM, 42(1), pp. 269–291 Preliminary version in STOC'89.CrossRefGoogle Scholar
5.Blum, Manuel (1993) Program result checking: a new approach to making programs more reliable. In International Colloquium on Automata, Languages, and Programming (ICALP), pp. 1–14.CrossRefGoogle Scholar
6.McConnell, R. M., Mehlhorn, K., Näher, S. and Schweitzer, P. (2011) Certifying algorithms. Computer Science Review, 5(2), pp. 119–161.CrossRefGoogle Scholar
7.Nipkow, T., Paulson, L. C. and Wenzel, M. (2002) Isabelle/HOL–A Proof Assistant for Higher-Order Logic, volume 2283 of Lecture Notes in Computer Science (Berlin: Springer).Google Scholar
8.Alkassar, E., Böhme, S., Mehlhorn, K. and Rizkallah, Ch. (2014) A framework for the verification of certifying computations. Journal of Automated Reasoning (JAR), 52(3), pp. 241–273. A preliminary version appeared under the title ‘Verification of Certifying Computations’ in CAV 2011, LCNS Vol 6806, pp. 67–82.CrossRefGoogle Scholar
9.Noschinski, L., Rizkallah, C. and Mehlhorn, K. (2014) Verification of certifying computations through autocorres and simpl. In: J. M. Badger and K. Y. Rozier, (ed.), NASA Formal Methods, vol. 8430 of Lecture Notes in Computer Science (Berlin: Springer International Publishing), pp. 46–61.CrossRefGoogle Scholar