Analysis of information sources in references of the Wikipedia article "Turing-complet" in French language version.
« The fact that all standard programming languages express precisely the class of partial recursive functions is often summarized by the statement that all programming languages are Turing complete. »