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
  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read
Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

Buy this book

Last edited by ImportBot
February 25, 2022 | History

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
  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

This edition doesn't have a description yet. Can you add one?

Publish Date
Publisher
Springer
Language
English
Pages
257

Buy this book

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

Library of Congress
QA267.7 .C53 2004, QA75.5-76.95

The Physical Object

Format
Hardcover
Number of pages
257
Dimensions
9.3 x 6.4 x 0.8 inches
Weight
1.2 pounds

ID Numbers

Open Library
OL9531834M
ISBN 10
1402027753
ISBN 13
9781402027758
LCCN
2008270655
Library Thing
6363472
Goodreads
1000326

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON
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