Computability, Enumerability, Unsolvability : Directions in Recursion Theory / Edited by S. B. Cooper, T. A. Slaman, S. S. Wainer.

Contributor(s): Cooper, S. B [editor of compilation.] | Slaman, T. A [editor of compilation.] | Wainer, S. S [editor of compilation.]Material type: TextTextSeries: London Mathematical Society Lecture Note Series ; no. 224Publisher: Cambridge : Cambridge University Press, 1996Description: 1 online resource (356 pages) : digital, PDF file(s)Content type: text Media type: computer Carrier type: online resourceISBN: 9780511629167 (ebook)Subject(s): Recursion theoryAdditional physical formats: Print version: : No titleDDC classification: 511.3/5 LOC classification: QA9.6 | .C66 1996Online resources: Click here to access online Summary: 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.
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK12192

Title from publisher's bibliographic system (viewed on 16 Oct 2015).

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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha