Search Type
  • All
  • Subject
  • Title
  • Author
  • Publisher
  • Series Title
Search Title

Download

Computability, Enumerability, Unsolvability

Directions in Recursion Theory

Computability, Enumerability, Unsolvability( )
Editor: Cooper, S. B.
Slaman, T. A.
Wainer, S. S.
Series title:London Mathematical Society Lecture Note Ser.
ISBN:978-0-521-55736-8
Publication Date:Jan 1996
Publisher:Cambridge University Press
Book Format:Paperback
List Price:AUD $86.95
Book Description:

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.

Book Details
Pages:356
Detailed Subjects: Mathematics / Logic
Physical Dimensions (W X L X H):15.2 x 22.8 x 2.1 cm
Book Weight:0.523 Kilograms



Featured Books

The Great Gatsby
Fitzgerald, F. Scott
Digital online: $4.99
Sense and Sensibility
Austen, Jane
Hardback: $17.00
The Devil and Miss Prym
Coelho, Paulo
Paperback: $15.99

Rate this title:

Select your rating below then click 'submit'.






I do not wish to rate this title.