This three-page article discusses how probabilistic decision trees can be faster than dterministic decision trees in checking for the disjointness of sets. The article is too restrictive and too particular to be of much general interest. The author’s assumptions are so severe that the theorem and proof seem to be of limited value. Even the seven-item reference list seems to be limited in scope.