Classical and New Paradigms of Computation and Their Complexity Hierarchies: Papers of the Conference Foundations of the Formal Sciences III (Hardcover, 2004)

Preface. Schedule. List of Participants. Complexity hierarchies derived from reduction functions; B. Lowe. Quantum query algorithms and lower bounds; A. Ambainis. Algebras of minimal rank: overview and recent developments; M. Blaser. 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 Camara. Axiomatizability of algebras of binary relations; S. Mikulas. Forcing axioms and projective sets of reals; R. Schindler. Post's and other problems of supertasks of higher type; P.D. Welch. References.