Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the concept of universality in computer science, focusing on universal constructions and consensus objects. It explains the shared memory model, deterministic and non-deterministic objects, and the implementation of a FIFO Queue. The lecture also delves into the universal algorithm, correctness proofs, and the preservation of non-determinism.