Induction & Recursion: Advanced Concepts

In course

Do laboris culpa consectetur anim nisi ea laborum ut ad exercitation cillum. Aliqua ullamco ullamco fugiat aute adipisicing aliqua amet minim reprehenderit culpa. Excepteur voluptate qui aute nulla quis exercitation reprehenderit mollit dolor adipisicing deserunt. Duis mollit voluptate id exercitation magna voluptate et minim do excepteur do commodo fugiat elit. Et nisi Lorem laborum aute nostrud aute velit mollit consectetur magna magna duis. Aliqua cillum sit et veniam sint incididunt voluptate. Ullamco ex Lorem ex et deserunt pariatur Lorem ullamco in.

Description

This lecture covers the advanced concepts of induction and recursion. It starts with proving statements by induction, then moves on to recursively defined functions, sets, and structures. The lecture also includes examples of summation formulas, inequalities, and Fibonacci numbers.

Official source

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

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

Mathematics

Mathematical logic: Set theory

Number theory: Topics in number theory

Algebra: Abstract algebra

Logic

Classical logic: First-order logic

Theoretical computer science

Programming language theory: High-level programming languages

Related lectures (87)