Non-programers were asked to organize natural English commands of a laboratory programing language into programs for solving name-sorting problems. The problems differed in the sort concept to be programed (conjunction vs. disjunction) and in the form of expression of the letter tests to be made on the names (affirmation vs. negation). (Author)