Interest was expressed in considering sort implementations as well as sort concepts, with the idea that a number of design decisions in a sort implementation would transcend the sort concept. That is, parts of an algorithm or algorithms used by the Sorting Machine might be used in other concept implementations, such as, for example, a search concept. It was also guessed that generalizing concepts in this way might restrict certain sets of implementation design choices from being made. Bruce Weide pointed out that this was not true of the sorting machine abstraction, and demonstrated how the sorting machine concept was independent of implementation design decisions.