The paper “On the Hardness of Almost-Sure Termination” by Benjamin Kaminski and Joost-Pieter Katoen has been accepted at the 40th MFCS (Mathematical Foundations in Computer Science) conference in Milano.  This paper considers the computational hardness of computing expected outcomes and deciding (universal) (positive) almost-sure termination of probabilistic programs with non-determinism.