Total Functions: How and Why

In course

Cupidatat enim proident aliquip occaecat deserunt consectetur nulla et et est quis. Reprehenderit dolor excepteur duis enim aliquip consectetur duis laboris eiusmod. Veniam ad ea aliqua quis in sunt eu. Ut eiusmod ex aliquip commodo Lorem anim aute officia aute cillum excepteur. In reprehenderit laborum adipisicing aliquip nostrud consequat tempor et consectetur enim ad. Deserunt reprehenderit ex ullamco ad nisi proident ullamco qui culpa elit.

Description

This lecture discusses the efficiency of hash tables, the importance of total functions in code modeling, and the use of well-founded relations to ensure termination of recursive functions. It also covers the concept of fixed points and the significance of total functions in proof frameworks.

Instructor

reprehenderit id non veniam

Eu dolor magna non labore elit eu est duis ad occaecat nostrud irure. Exercitation in ea pariatur anim exercitation voluptate. Enim voluptate adipisicing id esse anim incididunt pariatur aliqua cupidatat.

Official source

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

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

Related lectures (34)