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.
| ISBN: | 9780521557368 |
| Publication date: | 11th January 1996 |
| Author: | S B University of Leeds Cooper |
| Publisher: | Cambridge University Press |
| Format: | Paperback |
| Pagination: | 356 pages |
| Series: | London Mathematical Society Lecture Note Series |
| Genres: |
Mathematical theory of computation Mathematical logic |
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.
Computability, Enumerability, Unsolvability features in the following genres: Mathematical theory of computation, Mathematical logic
Paperback. £45.89, down from the £50.99 cover price. Not Available.
Computability, Enumerability, Unsolvability was written by S B University of Leeds Cooper and published by Cambridge University Press
Computability, Enumerability, Unsolvability has 356 pages
Yes it is part of London Mathematical Society Lecture Note Series series
£45.89, reduced from £50.99. Not Available.