Counting with Recurrence Relations

In course

Eu pariatur irure id nulla sint. Adipisicing occaecat eu nostrud ad ut ullamco irure est voluptate esse. Aliquip id duis pariatur deserunt magna aute. Officia ea qui eiusmod Lorem labore sit eiusmod dolore. Velit enim mollit ut aliqua. Ipsum veniam irure eiusmod occaecat.

Description

This lecture covers the concept of counting using recurrence relations, focusing on bit strings without consecutive 0s and the Tower of Hanoi problem. It explains the formalized and colloquial versions of proofs, providing examples and solutions.

Official source

https://mediaspace.epfl.ch/media/0_oimqh3ha

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Computer engineering

Computer architecture: Topics in computer architecture

Related lectures (33)