Cantitate/Preț
Produs
Total produse
Vezi coșul
Classical and New Paradigms of Computation and their Complexity Hierarchies: Papers of the conference "Foundations of the Formal Sciences III" de Benedikt Löwe

Classical and New Paradigms of Computation and their Complexity Hierarchies: Papers of the conference "Foundations of the Formal Sciences III": Trends in Logic, cartea 23

Editat de Benedikt Löwe, Boris Piwinger, Thoralf Räsch
en Limba Engleză Hardback – 15 feb 2005
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 127062 lei  6-8 săpt.
  SPRINGER NETHERLANDS – 6 dec 2010 127062 lei  6-8 săpt.
Hardback (1) 127686 lei  6-8 săpt.
  SPRINGER NETHERLANDS – 15 feb 2005 127686 lei  6-8 săpt.

Din seria Trends in Logic

Preț: 127686 lei

Preț vechi: 159608 lei
-20% Nou

Puncte Express: 1915
Preț estimativ în valută:
24439€ • 25418$ • 20480£

Carte tipărită la comandă

Livrare economică 13-27 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781402027758
ISBN-10: 1402027753
Pagini: 260
Ilustrații: XIII, 260 p.
Dimensiuni: 160 x 240 x 18 mm
Greutate: 0.56 kg
Ediția:2004
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Trends in Logic

Locul publicării:Dordrecht, Netherlands

Public țintă

Research

Cuprins

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.

Textul de pe ultima copertă

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.

Caracteristici

Focuses on some of the new paradigms of computation, among them Quantum Computing and Infinitary Computation