Office of Academic Resources
Chulalongkorn University
Chulalongkorn University

Home / Help

TitleClassical and New Paradigms of Computation and their Complexity Hierarchies [electronic resource] : Papers of the conference "Foundations of the Formal Sciences III" / edited by Benedikt Lรถwe, Boris Piwinger, Thoralf Rรคsch
ImprintDordrecht : Springer Netherlands, 2004
Connect to
Descript XIII, 260 p. online resource


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


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

Computer science Computers Computer science -- Mathematics Algorithms Mathematical logic Computer Science Computer Science general Theory of Computation Mathematical Logic and Foundations Math Applications in Computer Science Mathematics of Computing Algorithms


Office of Academic Resources, Chulalongkorn University, Phayathai Rd. Pathumwan Bangkok 10330 Thailand

Contact Us

Tel. 0-2218-2929,
0-2218-2927 (Library Service)
0-2218-2903 (Administrative Division)
Fax. 0-2215-3617, 0-2218-2907

Social Network


facebook   instragram