Mohs scale of mineral hardness integrity, they are not considered "scratches" for the determination of a Mohs scale number. The Mohs scale is a purely ordinal scale. For example, corundum (9) is twice as hard as topaz (8), but diamond (10) is four times as hard as corundum. The table below shows the comparison with the absolute hardness measured by a sclerometer, with pictorial examples. On the Mohs scale, a streak plate (unglazed porcelain) has a hardness of approximately 7.0. Using these ordinary materials of known hardness can be a simple way to approximate the position of a mineral on the scale. The table below
Hardness of approximation Hardness of approximation In computer science, hardness of approximation is a field that studies the algorithmic complexity of finding near-optimal solutions to optimization problems. Hardness of approximation complements the study of approximation algorithms by proving, for certain problems, a limit on the factors with which their solution can be efficiently approximated. Typically such limits show a factor of approximation beyond which a problem becomes NP-hard, implying that finding a polynomial time approximation for the problem is impossible unless NP=P. Some hardness of approximation results, however, are based on other hypotheses, a notable one among which is the unique games conjecture.