Advertisement

Recurrence and induction in computer science

  • A. J. van Zanten
Part of the Mathematics and Its Applications book series (MAIA, volume 81)

Abstract

Recurrence relations, or more generally, recursiveness, and proofs by mathematical induction are important ingredients of discrete mathematics. In this introductory paper it will be shown that these concepts can be applied extremely well to computer science. Moreover, the various examples by which these applications are illustrated will also demonstrate that both concepts are intimately related, and that there is a great deal of interaction between them in practical situations.

Keywords

Recurrence Relation Recursive Algorithm Induction Assumption Transition Sequence Mathematical Induction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Graham, R.L., Knuth, D.E. and Patashnik, O. Concrete Mathematics, Addison-Wesley Publ. Comp., Reading, Mass., 1989.Google Scholar
  2. [2]
    Grimaldi, R.P., Discrete and Combinatorial Mathematics, Addison-Wesley Publ. Comp., Reading, Mass., 1989.Google Scholar
  3. [3]
    Liu, C.L., Introduction to Combinatorial Mathematics, Mc Graw-Hill Book Comp., New York, 1968.zbMATHGoogle Scholar
  4. [4]
    Maurer, S.B. and Ralston, A., Discrete Algorithmics, Addison-Wesley Publ. Comp., Reading, Mass., 1991.Google Scholar
  5. [5]
    Papadimitriou, C.H. and Steiglitz, K., Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, Inc., Englewood Cliffs, N.J., 1982.zbMATHGoogle Scholar
  6. [6]
    Reingold, E.M., Nievergelt, J. and Narsingh Deo, Combinatorial Algorithms, Prentice Hall, Inc., Englewood Cliffs, N.J., 1977.Google Scholar
  7. [7]
    Truss, J.K., Discrete Mathematics for Computer Scientists, Addison-Wesley Publ. Comp., Reading, Mass, 1991.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1992

Authors and Affiliations

  • A. J. van Zanten
    • 1
  1. 1.Faculty of Technical Mathematics and InformaticsDelft University of TechnologyDelftThe Netherlands

Personalised recommendations