Computability, Enumerability, Unsolvability Directions in Recursion Theory |
|
| Editor:
| Cooper, S. B.
Slaman, T. A.
Wainer, S. S. |
| Series title: | London Mathematical Society Lecture Note Ser. |
| ISBN: | 978-0-511-62916-7 |
| Publication Date: | Feb 2010 |
| Publisher: | Cambridge University Press
|
| Book Format: | Digital download and online |
| List Price: | USD $165.00 |
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.
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.