Classical and New Paradigms of Computation and their Complexity Hierarchies 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

Benedikt Löwe

Boris Piwinger

Thoralf Räsch

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

	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.

Din seria Trends in Logic

Preț: 385^.35 lei
15%

Preț: 560^.36 lei
15%

Preț: 661^.48 lei
18%

Preț: 1177^.80 lei
18%

Preț: 922^.24 lei
15%

Preț: 621^.97 lei
15%

Preț: 665^.94 lei
18%

Preț: 1333^.68 lei
15%

Preț: 619^.91 lei
15%

Preț: 621^.80 lei
15%

Preț: 611^.57 lei
15%

Preț: 622^.42 lei
15%

Preț: 616^.28 lei
18%

Preț: 804^.11 lei
18%

Preț: 923^.14 lei
18%

Preț: 919^.07 lei
18%

Preț: 915^.13 lei
18%

Preț: 914^.22 lei
15%

Preț: 612^.23 lei
15%

Preț: 619^.61 lei
18%

Preț: 1767^.22 lei
18%

Preț: 910^.71 lei
15%

Preț: 610^.96 lei
18%

Preț: 860^.07 lei
24%

Preț: 1304^.66 lei
15%

Preț: 611^.27 lei
18%

Preț: 926^.30 lei
15%

Preț: 615^.66 lei
20%

Preț: 604^.83 lei
15%

Preț: 620^.07 lei

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ă