Shortcuts
Please wait while page loads.
SISSA Library . Default .
PageMenu- Main Menu-
Page content

Catalogue Display

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

Classical and New Paradigms of Computation and their Complexity Hierarchies: Papers of the conference “Foundations of the Formal Sciences III” /
Catalogue Information
Field name Details
Dewey Class 004
Title Classical and New Paradigms of Computation and their Complexity Hierarchies ([EBook] :) : Papers of the conference “Foundations of the Formal Sciences III” / / edited by Benedikt Löwe, Boris Piwinger, Thoralf Räsch.
Added Personal Name Löwe, Benedikt editor.
Piwinger, Boris editor.
Räsch, Thoralf editor.
Other name(s) SpringerLink (Online service)
Publication Dordrecht : : Springer Netherlands, , 2004.
Physical Details XIII, 260 p. : online resource.
Series Trends in Logic ; 23
ISBN 9781402027765
Summary Note 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.:
Contents note 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.
System details note Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site http://dx.doi.org/10.1007/978-1-4020-2776-5
Links to Related Works
Subject References:
Authors:
Corporate Authors:
Series:
Classification:
Catalogue Information 46184 Beginning of record . Catalogue Information 46184 Top of page .

Reviews


This item has not been rated.    Add a Review and/or Rating46184
Quick Search