product iamge

Classical and new paradigms of computation and their complexity hierarchies: papers of the conference "Foundations of the Formal Sciences III

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): Löwe, Benedikt; Piwinger, Boris; Räsch, Thoralf (eds.)
Series: Trends in logic 23
Publisher: Kluwer Academic publ
Year: 2004

Language: English
Pages: 257
City: Dordrecht, Vienne
Tags: Complexité de calcul (informatique) -- Congrès.;Fonctions d'une variable complexe -- Congrès.;Méthodes formelles (informatique) -- Congrès.

Content: Preface. Schedule. List of Participants. Complexity hierarchies derived from reduction functions
B. Loewe. 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.