. .
English
United States
Similar books
More/other books that might be very similar to this book
Search tools
Sign in
Share this book on...
Book recommendations
Latest news
Tip from find-more-books.com
Advertising
FILTER
- 0 Results
Lowest price: 57.24 €, highest price: 74.19 €, average price: 67.14 €
Computability, Enumerability, Unsolvability
book is out-of-stock
(*)
Computability, Enumerability, Unsolvability - new book

ISBN: 9780511893131

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. eBooks Computing~~Computer Science~~Mathematical Theory of Computation Computability, Enumerability, Unsolvability~~EBook~~9780511893131~~ S.S. Wainer, S.B. Cooper, T.A. Slaman Computability, Enumerability, Unsolvability

New book [GBR] Hive.co.uk
Shipping costs:plus shipping costs
Details...
(*) Book out-of-stock means that the book is currently not available at any of the associated platforms we search.
Computability, Enumerability, Unsolvability - Cambridge University Press
book is out-of-stock
(*)
Cambridge University Press:
Computability, Enumerability, Unsolvability - new book

ISBN: 9780511893131

ID: 125935031

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. Directions in Recursion Theory eBook eBooks>Fremdsprachige eBooks>Englische eBooks>Sach- & Fachthemen>Informatik, Cambridge University Press

New book Thalia.ch
No. 35737455 Shipping costs:, , CH (EUR 0.00)
Details...
(*) Book out-of-stock means that the book is currently not available at any of the associated platforms we search.
Computability, Enumerability, Unsolvability - Gouv?a, Fernando Q.;Yui,  Noriko
book is out-of-stock
(*)
Gouv?a, Fernando Q.;Yui, Noriko:
Computability, Enumerability, Unsolvability - new book

ISBN: 9780511893131

ID: 9780511893131

Directions in Recursion Theory, [KW: PDF ,MATHEMATICS , LOGIC ,MATHEMATICS ,MATHEMATICAL THEORY OF COMPUTATION] <-> <-> PDF ,MATHEMATICS , LOGIC ,MATHEMATICS ,MATHEMATICAL THEORY OF COMPUTATION

New book DE eBook.de
Sofort lieferbar (Download), E-Book zum Download Shipping costs: EUR 0.00
Details...
(*) Book out-of-stock means that the book is currently not available at any of the associated platforms we search.

Details of the book
Computability, Enumerability, Unsolvability
Author:

Gouv?a, Fernando Q.;Yui, Noriko

Title:

Computability, Enumerability, Unsolvability

ISBN:

Details of the book - Computability, Enumerability, Unsolvability


EAN (ISBN-13): 9780511893131
Publisher: Cambridge University Press

Book in our database since 03.04.2007 16:58:12
Book found last time on 19.06.2016 11:33:52
ISBN/EAN: 9780511893131

ISBN - alternate spelling:
978-0-511-89313-1


< to archive...
Related books