Recursion Theory, its Generalisations and Applications / Edited by F. R. Drake, S. S. Wainer.

Contributor(s): Drake, F. R [editor of compilation.] | Wainer, S. S [editor of compilation.]Material type: TextTextSeries: London Mathematical Society Lecture Note Series ; no. 45Publisher: Cambridge : Cambridge University Press, 1980Description: 1 online resource (328 pages) : digital, PDF file(s)Content type: text Media type: computer Carrier type: online resourceISBN: 9780511629181 (ebook)Other title: Recursion Theory, its Generalisations & ApplicationsAdditional physical formats: Print version: : No titleOnline resources: Click here to access online Summary: Recursion theory – now a well-established branch of pure mathematics, having grown rapidly over the last 35 years – deals with the general (abstract) theory of those operations which we conceive as being `computable' by idealized machines. The theory grew out of, and is usually still regarded, as a branch of mathematical logic. This book is a collection of advanced research/survey papers by eminent research workers in the field, based on their lectures given at the Leeds Logic Colloquium 1979. As such it provides an up-to-date view of current ideas and developments in the field of recursion theory as a whole. The individual contributions fit together naturally so as to provide an overview of all the main areas of research in the field. It will therefore be an important and invaluable source for advanced researchers and research students in mathematics and computer science (particularly in Europe, USA and USSR).
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 EBK11992

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

Recursion theory – now a well-established branch of pure mathematics, having grown rapidly over the last 35 years – deals with the general (abstract) theory of those operations which we conceive as being `computable' by idealized machines. The theory grew out of, and is usually still regarded, as a branch of mathematical logic. This book is a collection of advanced research/survey papers by eminent research workers in the field, based on their lectures given at the Leeds Logic Colloquium 1979. As such it provides an up-to-date view of current ideas and developments in the field of recursion theory as a whole. The individual contributions fit together naturally so as to provide an overview of all the main areas of research in the field. It will therefore be an important and invaluable source for advanced researchers and research students in mathematics and computer science (particularly in Europe, USA and USSR).

There are no comments on this title.

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

Powered by Koha