The "Hamming problem" in Prolog


Dijkstra [1] attributes to Hamming the problem of generating the set {213)5 k [ i,j,k >_0} in increasing order. Kahn and MacQueen [4] showed how to solve the problem with a stream-processing program that could be implemented with concurrent processes, and since then it has often been cited as an example of a problem whose concurrent solutions are simpler… (More)
DOI: 10.1145/44326.44335