An edition of Computability, enumerability, unsolvability (1996)

Computability, enumerability, unsolvability

directions in recursion theory

by

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read
Cover of: Computability, enumerability, unsolvability by edited by S.B. Cooper, T.A. Slaman, S.S. Wainer.
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
Notes
  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read
Notes

Check nearby libraries

Buy this book

Last edited by MARC Bot
July 18, 2024 | History
Edit
An edition of Computability, enumerability, unsolvability (1996)

Computability, enumerability, unsolvability

directions in recursion theory

by

  • 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
Publisher
Cambridge University Press
Language
English
Pages
347

Check nearby libraries

Buy this book

Previews available in: English

Subjects
Recursion theory, Recursivité, Théorie de la, COMPUTERS, Machine Theory, Rekursionstheorie, Aufsatzsammlung, Recursie, Logica, Récursivité, théorie de la

Showing 4 featured editions. View all 4 editions?

Edition Availability
Cover of: Computability, Enumerability, Unsolvability
Computability, Enumerability, Unsolvability: Directions in Recursion Theory
2011, Cambridge University Press
in English
Libraries near you: WorldCat
Cover of: Computability, Enumerability, Unsolvability
Computability, Enumerability, Unsolvability: Directions in Recursion Theory
2010, Cambridge University Press
in English
Libraries near you: WorldCat
Cover of: Computability, Enumerability, Unsolvability
Computability, Enumerability, Unsolvability: Directions in Recursion Theory (London Mathematical Society Lecture Note Series)
January 26, 1996, Cambridge University Press
Paperback in English
Libraries near you: WorldCat
Cover of: Computability, enumerability, unsolvability
Computability, enumerability, unsolvability: directions in recursion theory
1996, Cambridge University Press
in English
  • Not in Library
Libraries near you: WorldCat

Add another edition?

Book Details

Edition Notes

Includes bibliographical references.

Published in
Cambridge [England], New York
Series
London Mathematical Society lecture note series ;, 224

Classifications

Dewey Decimal Class
511.3/5
Library of Congress
QA9.6 .C66 1996

The Physical Object

Pagination
vii, 347 p. ;
Number of pages
347

ID Numbers

Open Library
OL808030M
Internet Archive
computabilityenu00coop
ISBN 10
0521557364
LCCN
95044750
Library Thing
7178480
Goodreads
982830

Source records

Internet Archive item record

Community Reviews (0)

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

Lists

See All

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