It has been demonstrated that Belady’s Min algorithm is suboptimal for metadata caching. In this project (co-advised by Prof. Mik Zlatin), we prove formally the computability of this task.