Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Hauptmenü
-
Einfache Suche
.
Erweiterte Suche
.
Zeitschriften-Suche
.
Suchergebnisse verfeinern
.
Präferenzen
.
Search Menu
Einfache Suche
.
Erweiterte Suche
.
Suche nach Neuerwerbungen
.
Zeitschriften-Suche
.
Suchergebnisse verfeinern
.
Bottom Menu
Hilfe
Italienisch
.
Englisch
.
Deutsch
.
New Item Menu
Suche nach Neuerwerbungen
.
Neuerwerbungsliste
.
Titelsammlung anzeigen
.
Links
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
Sie befinden sich hier
:
>
Search Simple
>
Katalogdatenanzeige
>
Suchergebnisse
>
Regalbrowser
Catalogue Card Display
Catalogue Card Display
RAK
Title: Classical and New Paradigms of Computation and their Complexity Hierarchies ([EBook] :) : Papers of the conference “Foundations of the Formal Sciences III” // edited by Benedikt Löwe, Boris Piwinger, Thoralf Räsch. Dewey Class: 004 Added Personal Name: Löwe, Benedikt. editor. Piwinger, Boris. editor. Räsch, Thoralf. editor. Publication: Dordrecht : : Springer Netherlands,, 2004. Other name(s): SpringerLink (Online service) Physical Details: XIII, 260 p. : online resource. Series: Trends in Logic ;; 23 ISBN: 9781402027765 System details note: Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users) Summary Note: 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.: Contents note: 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. ------------------------------ *** Es sind keine Exemplare vorhanden *** -----------------------------------------------
Schnellsuche
Suche nach