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
Publisher:   Springer
Edition:   Softcover reprint of hardcover 1st ed. 2004
Volume:   23
ISBN:  

9789048167180


Pages:   260
Publication Date:   06 December 2010
Format:   Paperback
Availability:   Out of stock   Availability explained
The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available.

Our Price $446.16 Quantity:  
Add to Cart

Share |

Classical and New Paradigms of Computation and their Complexity Hierarchies: Papers of the conference ""Foundations of the Formal Sciences III""


Add your own review!

Overview

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.

Full Product Details

Author:   Benedikt Löwe ,  Boris Piwinger ,  Thoralf Räsch
Publisher:   Springer
Imprint:   Springer
Edition:   Softcover reprint of hardcover 1st ed. 2004
Volume:   23
Dimensions:   Width: 15.50cm , Height: 1.40cm , Length: 23.50cm
Weight:   0.454kg
ISBN:  

9789048167180


ISBN 10:   9048167183
Pages:   260
Publication Date:   06 December 2010
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Out of stock   Availability explained
The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available.

Table 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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now