Classical and New Paradigms of Computation and their Complexity Hierarchies Papers of the conference "Foundations of the Formal Sciences III"
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 p...
| Other Authors: | , , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Dordrecht
Springer Netherlands
2004, 2004
|
| Edition: | 1st ed. 2004 |
| Series: | Trends in Logic, Studia Logica Library
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- 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