2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/30959We show that Naming-- the existence of distinct IDs known to all-- is a hidden but necessary assumption of Herlihy's universality result for Consensus. We then show in a very precise sense that Naming is harder than Consensus and bring to the surface some important differences existing between popular shared memory models.LaTeX, 15 pages, In: Distributed Computing Conference (DISC'00), Lecture Notes in Computer Science, Vol. 1914, Springer-Verlag, Berlin, 2000, 134--148Distributed, Parallel, and Cluster ComputingComputational ComplexityF.1.2; C.2.4; B.3.2;B.4.3;D.1.3;D.4.1;D.4.4text