Good summary. As I finished working through his algorithm description, I wondered at the sentence in the summary that motivated me to read closely: 'An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and low-order additive terms.' "Low-order additive terms"? Come on.