Recurrence and induction in computer science
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.
KeywordsRecurrence Relation Recursive Algorithm Induction Assumption Transition Sequence Mathematical Induction
Unable to display preview. Download preview PDF.
- Graham, R.L., Knuth, D.E. and Patashnik, O. Concrete Mathematics, Addison-Wesley Publ. Comp., Reading, Mass., 1989.Google Scholar
- Grimaldi, R.P., Discrete and Combinatorial Mathematics, Addison-Wesley Publ. Comp., Reading, Mass., 1989.Google Scholar
- Maurer, S.B. and Ralston, A., Discrete Algorithmics, Addison-Wesley Publ. Comp., Reading, Mass., 1991.Google Scholar
- Reingold, E.M., Nievergelt, J. and Narsingh Deo, Combinatorial Algorithms, Prentice Hall, Inc., Englewood Cliffs, N.J., 1977.Google Scholar
- Truss, J.K., Discrete Mathematics for Computer Scientists, Addison-Wesley Publ. Comp., Reading, Mass, 1991.Google Scholar