Classical and New Paradigms of Computation and Their Complexity Hierarchies Book

	Complexity hierarchies derived from reduction functions	1
	Quantum query algorithms and lower bounds	15
	Algebras of minimal rank : overview and recent developments	33
	Recent developments in iterated forcing theory	47
	Classification problems in algebra and topology	61
	Using easy optimization problems to solve hard ones	77
	On Sacks forcing and the Sacks property	95
	Supertask computation	141
	A refinement of Jensen's constructible hierarchy	159
	Effective Hausdorff dimension	171
	Axiomatizability of algebras of binary relations	187
	Forcing axioms and projective sets of reals	207
	Post's and other problems of supertasks of higher type	223