Computability: A Mathematical Sketchbook: 146 - Rilegato

Bridges, Douglas S.

Rilegato

ISBN 10: 0387941746 ISBN 13: 9780387941745

Casa editrice: Springer-Verlag GmbH, 1994

Riassunto

Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, Computability: A Mathematical Sketchbook provides a brief but rigorous introduction to the abstract theory of computation, sometimes also referred to as recursion theory. It develops major themes in computability theory, such as Rice's theorem and the recursion theorem, and provides a systematic account of Blum's complexity theory as well as an introduction to the theory of computable real numbers and functions. The book is intended as a university text, but it may also be used for self-study; appropriate exercises and solutions are included.

Su questo libro

Informazioni sull'autore

Prof. Douglas S. Bridges is a professor of pure mathematics at the University of Canterbury. His research interests include the constructive foundations of analysis and topology; mathematical economics; computability and abstract complexity theory; and quantum logic. He has published many related articles and papers, among his 8 authored books are "Computability: A Mathematical Sketchbook", "Foundations of Real and Abstract Analysis", and "Techniques of Constructive Analysis". He is a Fellow of the Royal Society of New Zealand, and a Corresponding Fellow of the Royal Society of Edinburgh. Dr. Lumini¿a Simona Vî¿¿ is an Adjunct Fellow of the Department of Mathematics and Statistics, University of Canterbury, and a Senior Business Analyst with the New Zealand Customs Service. Her research interests include constructive foundations of analysis and topology, and recursive function theory, computability and complexity. She has published many related articles and papers, and coauthored "Techniques of Constructive Analysis".

Dalla quarta di copertina

Computability: A Mathematical Sketchbook is a concise, rigorous introduction to the theory of computation. Using Turing machines as models of computers, the author develops major themes of computability theory, culminating in a systematic account of Blum's abstract complexity measures. One of the book's unique aspects is the inclusion of a chapter on computable real numbers and elementary computable analysis. Exercises and solutions form an integral part of the material. The book is suitable for self-study and provides excellent course materials for senior and graduate-level students in mathematics and computer science.

Dettagli dell'edizione

• Editore: Springer-Verlag GmbH
• Data di pubblicazione: 1994
• Lingua: Inglese
• ISBN 10: 0387941746
• ISBN 13: 9780387941745
• Rilegatura: Copertina rigida
• Numero di pagine: 180
• Contatto del produttore: Springer Nature Customer Service Center GmbH; ProductSafety@springernature.com; ; Europaplatz 3; Heidelberg; 69115; Germania