Preface. Schedule. List of Participants. Complexity hierarchies derived from reduction functions; B. Löwe. Quantum query algorithms and lower bounds; A. Ambainis. Algebras of minimal rank: overview and recent developments; M. Bläser. Recent developments in iterated forcing theory; J. Brendle. Classification problems in algebra and topology; R. Camerlo. Using easy optimization problems to solve hard ones; L. Engebretsen. On Sacks forcing and the Sacks property; S. Geschke, S. Quickert. Supertask computation; J.D. Hamkins. A refinement of Jensen's constructible hierarchy; P. Koepke, M. van Eijmeren. Effective Hausdorff dimension; E. Mayordomo Cámara. Axiomatizability of algebras of binary relations; S. Mikulás. Forcing axioms and projective sets of reals; R. Schindler. Post's and other problems of supertasks of higher type; P.D. Welch. References.

The notion of complexity is an important contribution of logic to theoretical computer science and mathematics. This volume attempts to approach complexity in a holistic way, investigating mathematical properties of complexity hierarchies at the same time as discussing algorithms and computational properties. A main focus of the volume is on some of the new paradigms of computation, among them Quantum Computing and Infinitary Computation. The papers in the volume are tied together by an introductory article describing abstract properties of complexity hierarchies.

This volume will be of great interest to both mathematical logicians and theoretical computer scientists, providing them with new insights into the various views of complexity and thus shedding new light on their own research.