====== Preface ====== * Algorithms, and the insight afforded by their formal study, are widely useful. In particular, algorithms are the core of CS once one abstracts the messier details of interface and low-level implementation. Therefore, algorithms are more suitable to formal analysis than any superset of CS, while remaining sufficiently general that observations about algorithms are insightful into the whole. * Trust the economist to produce a theoretical objection to a common practice despite the lack of actual problems observed. * No questions. * Perhaps I underestimate the background knowledge that can be expected, but I would think that it might be advantageous to start with a brief definition of an algorithm--this section seems aimed at those who know what algorithms are but are not convinced of their usefulness, which must be a rather small part of the population. Overall I would give readability 7/10; the lack of introduction hurts, but otherwise I thought it as well-written as one can expect for a section nearly without content by design.