Replicability and stability in learning

How replicable can learning algorithms be? There are several notions of replicability and stability of algorithms, and we discuss one termed "global stability", which we believe is a simple one. We will discuss impossibility results, showing learning algorithms cannot be too globally stable; to do so, we utilize topological methods, specifically Sperner's Lemma, or the Poincaré-Miranda theorem.