These are scribed notes from a graduate courses on Computational Complexity offered at …
notes scribed by students in Spring 2001 and on additional notes scribed in Fall 2002. I added …

… of playing a note, spacing between notes, intervalwidth range … , probability of note activity
and spacing between notes. This in… of playing a note, the spacing between notes, melodic …

… We note that being guided by the conceptual contents of the material leads, in some
cases, to technical simplifications. Indeed, for many of the results presented in this book, the …

… have been defined and interesting results obtained (see Notes), we shall focus our
attention on the more familiar dynamic measures. A natural example of such measures is time; …

… In a long footnote to this passage, Hayek relates the idea of complexity to von Neumann’s
work. In that note, Hayek suggests one way of imagining the number of entities in any level of …

… of the intrinsic complexity of computational tasks, … , Complexity Theory aims at understanding
the nature of e cient computation. Topics: In my opinion, a introductory course in complexity …

… notes describe some complexity-theoretic results concerning problems of classical number
theory. We assume the standard machinery of complexity … is to make these notes nearly self-…

… this note we investigate the role of Lloyd’s computational bound in holographic complexity. …
that these notions are useful for diagnosing holographic complexity. We show that large black …

… of complexity to compare the complexity, say, of stories and of machines. What we do know
is that complexity is … Note that in each case the second, complexity-reflective alternative has a …

… Complexity is generally viewed as an intrinsic property of certain kinds of systems, or at least…
The view towards complexity taken in the present note is different; namely, that complexity …