Classical and New Paradigms of Computation and their Complexity Hierarchies: Papers of the conference “Foundations of the Formal Sciences III”Author: Benedikt Löwe, Boris Piwinger, Thoralf Räsch Published by Springer Netherlands ISBN: 978-1-4020-2775-8 DOI: 10.1007/978-1-4020-2776-5Table of Contents:Complexity hierarchies derived from reduction functions Quantum query algorithms and lower bounds Algebras of minimal rank: overview and recent developments Recent developments in iterated forcing theory Classification problems in algebra and topology Using easy optimization problems to solve hard ones On Sacks forcing and the Sacks property Supertask computation A refinement of Jensen's constructible hierarchy Effective Hausdorff dimension Axiomatizability of algebras of binary relations Forcing axioms and projective sets of reals Post's and other problems of supertasks of higher type, Includes bibliographical references (p. [239]-257)