Recursion theory its generalisations and applications : proceedings of Logic Colloquium '79, Leeds, August 1979 ed. Logic colloquium 1979; Lecture note series 45.

ISBN 10: 052123543X / ISBN 13: 9780521235433

Published by Cambridge, Cambridge University Press, 1980

About this Item

Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 03 REC 9780521235433 Sprache: Englisch Gewicht in Gramm: 550.

Seller Inventory # 2506782

Bibliographic Details

• Title: Recursion theory its generalisations and applications : proceedings of Logic Colloquium '79, Leeds, August 1979 ed. Logic colloquium 1979; Lecture note series 45.
• Publisher: Cambridge, Cambridge University Press
• Publication Date: 1980
• Language: English
• ISBN 10: 052123543X
• ISBN 13: 9780521235433
• Binding: Softcover
• Weight: 550 grams
• Seller catalogs:
  • SA MATHEMATIK

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.