ABSTRACT
The author discusses here is not whether the proof by Sraffa can be completed or not. It can, of course. In providing Sraffa proof people cannot use the Perron-Frobenius Theorem, since the proof itself can be considered an alternative proof of this theorem. Lippi provides complete proof in an appendix of his paper by using a very special algorithm from among all the algorithms. Another special algorithm has been provided, without a proof, by Kurz and Salvadori. Instead Salvadori want to investigate what are the properties that an algorithm needs to have in order to obtain a complete proof. The fact that Sraffa has not chosen a particular algorithm makes us think that he was convinced that any algorithm would do the job. This is wrong, but, as Salvadori shows, any algorithm satisfying an extra assumption does actually do the job. The chapter provides the intuition that underlies his argument. He put forward a formal presentation of the proof.
