Classical and New Paradigms of Computation and Their Complexity Hierarchies
Papers of the Conference Foundations of the Formal Sciences III
Besorgungstitel - wird vorgemerkt | Lieferzeit: Besorgungstitel - Lieferbar innerhalb von 10 Werktagen I
294,03 €*
Alle Preise inkl. MwSt.|Versandkostenfrei
ISBN-13:
9781402027758
Veröffentl:
2005
Erscheinungsdatum:
15.02.2005
Seiten:
260
Autor:
Benedikt Löwe
Gewicht:
562 g
Format:
234x156x18 mm
Sprache:
Englisch
Beschreibung:
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.
Focuses on some of the new paradigms of computation, among them Quantum Computing and Infinitary Computation
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.
Kunden Rezensionen
Mehr zum Thema
Folgen Sie uns auf:
