Recursion Theory, Its Generalisations and Applications

F. R. Drake (u. a.)

ISBN 10: 052123543X / ISBN 13: 9780521235433

Published by Cambridge University Press, 2008

About this Item

Recursion Theory, Its Generalisations and Applications | F. R. Drake (u. a.) | Taschenbuch | Kartoniert / Broschiert | Englisch | 2008 | Cambridge University Press | EAN 9780521235433 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.

Seller Inventory # 101853831

Bibliographic Details

• Title: Recursion Theory, Its Generalisations and Applications
• Publisher: Cambridge University Press
• Publication Date: 2008
• Language: English
• ISBN 10: 052123543X
• ISBN 13: 9780521235433
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 229W x 152H x 19D millimeters 229 millimeters width by 152 millimeters height by 19 millimeters depth
• Weight: 534 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

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).

Book Description

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.