Classical and New Paradigms of Computation and Their Complexity Hierarchies
Editat de Benedikt Löwe, Boris Piwinger, Thoralf Räschen Limba Engleză Hardback – 15 feb 2005
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.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 1221.14 lei 6-8 săpt. | |
| SPRINGER NETHERLANDS – 6 dec 2010 | 1221.14 lei 6-8 săpt. | |
| Hardback (1) | 1227.15 lei 6-8 săpt. | |
| Springer – 15 feb 2005 | 1227.15 lei 6-8 săpt. |
Preț: 1227.15 lei
Preț vechi: 1533.94 lei
-20% Nou
Puncte Express: 1841
Preț estimativ în valută:
217.11€ • 255.25$ • 190.16£
217.11€ • 255.25$ • 190.16£
Carte tipărită la comandă
Livrare economică 29 ianuarie-12 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781402027758
ISBN-10: 1402027753
Pagini: 260
Ilustrații: XIII, 260 p.
Dimensiuni: 156 x 234 x 18 mm
Greutate: 0.56 kg
Ediția:2004 edition
Editura: Springer
Locul publicării:Dordrecht, Netherlands
ISBN-10: 1402027753
Pagini: 260
Ilustrații: XIII, 260 p.
Dimensiuni: 156 x 234 x 18 mm
Greutate: 0.56 kg
Ediția:2004 edition
Editura: Springer
Locul publicării:Dordrecht, Netherlands
V-ar putea interesa
-
Elements of Set TheoryHerbert B. Enderton-33%Preț: 356.30 lei531.87 lei -
To Mock a Mockingbird: and Other Logic PuzzlesRaymond Smullyan-21%Preț: 71.94 lei91.50 lei -
DefinitionRichard Robinson-35%Preț: 720.18 lei1100.53 lei -
-31%Preț: 424.97 lei616.64 lei -
Not Exactly: In Praise of VaguenessKees van Deemter-16%Preț: 112.71 lei134.88 lei -
Godel's ProofErnest NagelPreț: 116.03 lei -
Preț: 134.48 lei -
Preț: 80.80 lei -
First-Order LogicRaymond M. SmullyanPreț: 57.41 lei -
Theory of Computational ComplexityDing-Zhu Du-9%Preț: 787.72 lei865.63 lei -
Preț: 516.24 lei -
Preț: 178.43 lei -
Incompleteness in the Land of SetsM. FittingPreț: 219.08 lei -
-20%Preț: 628.59 lei785.75 lei
Public țintă
ResearchCuprins
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.
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