Classical and New Paradigms of Computation and their Complexity Hierarchies
Papers of the conference "Foundations of the Formal Sciences III" (Trends in Logic)
by Benedikt Löwe
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.
Check nearby libraries
Buy this book
Subjects
Algoritmen, Computational complexity, Congresses, Functions of complex variables, Recursie, Complexiteit, Paradigms (social sciences), Algorithms, Computer science, Information theory, Symbolic and mathematical Logic, Computer Science, general, Theory of Computation, Mathematical Logic and Foundations, Math Applications in Computer Science, Mathematics of Computing| Edition | Availability |
|---|---|
1
Classical and New Paradigms of Computation and Their Complexity Hierarchies: Papers of the Conference Foundations of the Formal Sciences III
2007, Springer
in English
1402027761 9781402027765
|
zzzz
|
2
Classical and New Paradigms of Computation and their Complexity Hierarchies: Papers of the conference "Foundations of the Formal Sciences III" (Trends in Logic)
April 29, 2005, Springer
Hardcover
in English
- 1 edition
1402027753 9781402027758
|
aaaa
|
Book Details
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."
Classifications
The Physical Object
Edition Identifiers
Work Identifiers
Community Reviews (0)
Lists
| September 28, 2024 | Edited by MARC Bot | import existing book |
| February 25, 2022 | Edited by ImportBot | import existing book |
| December 20, 2020 | Edited by MARC Bot | import existing book |
| July 28, 2014 | Created by ImportBot | import new book |