Computability, Enumerability, Unsolvability

Directions in Recursion Theory (London Mathematical Society Lecture Note Series)

  • 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 MARC Bot
July 18, 2024 | History

Computability, Enumerability, Unsolvability

Directions in Recursion Theory (London Mathematical Society Lecture Note Series)

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

The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference.

A number of the articles contain introductory and background material which it is hoped will make this volume an invaluable resource.

Publish Date
Language
English
Pages
355

Buy this book

Previews available in: English

Edition Availability
Cover of: Computability, Enumerability, Unsolvability
Computability, Enumerability, Unsolvability: Directions in Recursion Theory
2011, Cambridge University Press
in English
Cover of: Computability, Enumerability, Unsolvability
Computability, Enumerability, Unsolvability: Directions in Recursion Theory
2010, Cambridge University Press
in English
Cover of: Computability, Enumerability, Unsolvability
Cover of: Computability, enumerability, unsolvability
Computability, enumerability, unsolvability: directions in recursion theory
1996, Cambridge University Press
in English

Add another edition?

Book Details


First Sentence

"The finite extension method is a central diagonalization technique in computability theory (see e.g. [Ro67], [Od89], [So87])."

Classifications

Library of Congress
QA9.6 .C66 1996, QA9.6 .C66 1996eb

The Physical Object

Format
Paperback
Number of pages
355
Dimensions
8.8 x 6 x 0.8 inches
Weight
1.1 pounds

ID Numbers

Open Library
OL7746284M
Internet Archive
computabilityenu00coop_148
ISBN 10
0521557364
ISBN 13
9780521557368
LCCN
95044750
OCLC/WorldCat
503586559
Library Thing
7178480
Goodreads
982830

Community Reviews (0)

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

History

Download catalog record: RDF / JSON
July 18, 2024 Edited by MARC Bot import existing book
August 13, 2021 Edited by MARC Bot import existing book
April 9, 2019 Created by MARC Bot import existing book