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. |
| Онлайн достъп от Библиотека ”Паница” на Американския университет в България: |
http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=552379 |
|---|
| Провери в Paniza Library, AUBG | Сигнатура: |
QA9.6 .C66 1996eb |
|---|