Classical and New Paradigms of Computation and their Complexity Hierarchies
Papers of the conference "Foundations of the Formal Sciences III" (Trends in Logic)
1 edition
Our rough guess is there are 64,250 words in this book.
At a pace averaging 250 words per minute, this book will take 4 hours and 17 minutes to read. With a half hour per day, this will take 9 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Benedikt Löwe (Editor) - Contributor
- Boris Piwinger (Editor) - Contributor
- Thoralf Räsch (Editor) - Contributor
Publication
2005-04-29 - Springer
Language
English
Word Count
64,250 words, Guess
Page Count
257 pages
Physical Format
Hardcover
Identifiers
- Open LibraryOL9531834M
- ISBN-139781402027758
- ISBN-101402027753
- Library of Congress Control Number2008270655
- Goodreads1000326
and 1 more
- LibraryThing6363472
Classifications
- LCCQA267.7 .C53 2004
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.
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.
Subjects
Topics
Other Editions
- Classical and New Paradigms of Computation and their Complexity Hierarchies: Papers of the conference "Foundations of the Formal Sciences III" (Trends in Logic)
Similar Books
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!