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-Verlag New York Inc.
Edition:   2004 ed.
Volume:   23
ISBN:  

9781402027758


Pages:   260
Publication Date:   15 February 2005
Format:   Hardback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

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""


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-Verlag New York Inc.
Imprint:   Springer-Verlag New York Inc.
Edition:   2004 ed.
Volume:   23
Dimensions:   Width: 16.00cm , Height: 1.70cm , Length: 24.00cm
Weight:   1.250kg
ISBN:  

9781402027758


ISBN 10:   1402027753
Pages:   260
Publication Date:   15 February 2005
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

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:  

Countries Available

All regions
Latest Reading Guide

NOV RG 20252

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now