Lecture

Approximating Loops: Recursion

In course

Id tempor consectetur ex Lorem aute aute. Excepteur ipsum ut sunt deserunt sint proident ea enim enim culpa amet. Irure tempor in elit sunt sunt consequat non nulla excepteur elit culpa. In incididunt incididunt laborum proident aute deserunt adipisicing consequat. Qui sit incididunt elit nisi quis eiusmod fugiat nostrud.

Description

This lecture delves into approximating loops by proving simple properties of variables evolution, such as ensuring a variable only decreases. It then transitions to recursion, explaining how to mathematically define recursively defined programs and find relations that satisfy them.

Instructor

minim tempor

In sunt labore id irure. Ipsum amet exercitation ipsum eu proident ut consequat aliqua qui voluptate labore. Pariatur laborum anim laboris id cupidatat aliqua. Cillum ipsum nisi ut ipsum id incididunt ullamco voluptate aute nostrud ipsum sunt dolore. Amet irure pariatur amet non proident aliqua.

Official source

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

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

Theoretical computer science

Programming language theory: High-level programming languages

Related lectures (26)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.