Check nearby libraries
Buy this book
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.
Check nearby libraries
Buy this book
Previews available in: English
Showing 5 featured editions. View all 5 editions?
Edition | Availability |
---|---|
1
Computability, Enumerability, Unsolvability: Directions in Recursion Theory
2011, Cambridge University Press
in English
0511893132 9780511893131
|
zzzz
Libraries near you:
WorldCat
|
2
Computability, Enumerability, Unsolvability: Directions in Recursion Theory
2010, Cambridge University Press
in English
0511629168 9780511629167
|
aaaa
Libraries near you:
WorldCat
|
3
Computability, Enumerability, Unsolvability
1996, Cambridge University Press
in English
1299404944 9781299404946
|
zzzz
Libraries near you:
WorldCat
|
4
Computability, Enumerability, Unsolvability: Directions in Recursion Theory (London Mathematical Society Lecture Note Series)
January 26, 1996, Cambridge University Press
Paperback
in English
0521557364 9780521557368
|
zzzz
Libraries near you:
WorldCat
|
5
Computability, enumerability, unsolvability: directions in recursion theory
1996, Cambridge University Press
in English
0521557364 9780521557368
|
zzzz
Libraries near you:
WorldCat
|
Community Reviews (0)
Feedback?History
- Created October 4, 2021
- 1 revision
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
October 4, 2021 | Created by ImportBot | Imported from Better World Books record |