Wikipedia:Maldoror's Conjecture

This is an essay.

It contains the advice or opinions of one or more Wikipedia contributors. This page is not an encyclopedia article, nor is it one of Wikipedia's policies or guidelines, as it has not been thoroughly vetted by the community. Some essays represent widespread norms; others only represent minority viewpoints.

Maldoror's Conjecture (Spanish: Conjetura de Maldoror) establishes that, n being the number of possible ways to vandalize an article and m the possible number of official prohibitions to prevent vandalism of an article, it is the case that:

n > m

That is, there will always be ways to vandalize an article that are not expressly gathered as prohibitions in the policies of the Wikipedia.^[a]

In order to replace those inevitable lacunae, it is necessary to resort to common sense. In the case of damage or vandalism to Wikipedia, it is possible to act even though policies do not contemplate the specific case. However, the aim of the policies will have to be the same as the one that guides the action taken on the basis of the common sense.

Name

This conjecture was formulated originally by Maldoror, a retired user of Spanish Wikipedia. It is called a conjecture applying the definition of the concept, since it is a proposal that is presumed real or true, but is based on foundations of an empirical nature and therefore it is not as easily verifiable or testable as a hypothesis.

Notes

^ The conjecture would be false if the possible number of vandalisms n were finite. Since n does not seem to depend too much on the number of articles of Wikipedia, this being a finite system has little effect on n; there are always more pages and new users, including incoming vandals. In any case, one can be sure that n will be so great that it will be impossible that m reaches it.

[1] The conjecture would be false if the possible number of vandalisms n were finite. Since n does not seem to depend too much on the number of articles of Wikipedia, this being a finite system has little effect on n; there are always more pages and new users, including incoming vandals. In any case, one can be sure that n will be so great that it will be impossible that m reaches it.

[a]