Computability, enumerability, unsolvability directions in recursion 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 m...
| Други автори: | Cooper, S. B., Slaman, T. A. 1954-, Wainer, S. S. |
|---|---|
| Формат: | Електронен |
| Език: | English |
| Публикувано: |
Cambridge [England] ; New York :
Cambridge University Press,
1996.
|
| Серия: |
London Mathematical Society lecture note series ;
224. |
| Предмети: | |
| Онлайн достъп: |
http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=552379 |
| Подобни документи: |
Print version::
Computability, enumerability, unsolvability. |
| Резюме: |
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. |
|---|---|
| Физически характеристики: |
1 online resource (vii, 347 pages). |
| Библиография: |
Includes bibliographical references. |
| ISBN: |
9781107362390 1107362393 9780511629167 0511629168 |