Classical and New Paradigms of Computation and their Complexity Hierarchies
Subtitle: Papers of the conference "Foundations of the Formal Sciences III" (Trends in Logic)
Contributors: Benedikt Löwe (Editor); Boris Piwinger (Editor); Thoralf Räsch (Editor)
Edition: 1 edition
Publisher: Springer
Published: April 29, 2005
Language: eng
Format: Hardcover
Number of pages: 257
ISBN-13: 9781402027758
Subjects: Logic; Mathematical logic; Computer Science; Computers; Computers - General Information; Computer Books: General; Programming - Algorithms; Computers / General
First sentence: Logic is famous for what Hofstadter calls limitative theorems: Gödel's incompleteness theorems, Tarski's result on the undefinability of truth, and Turing's proof of the non-computability of the halting problem.
Description: 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.