Computability
A Mathematical Sketchbook
Published on 13. July 2013
Book
Paperback/Softback
XI, 180 pages
978-1-4612-6925-0 (ISBN)
Description
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.
More details
Series
Edition
Softcover reprint of the original 1st ed. 1994
Language
English
Place of publication
New York
United States
Target group
Primary & secondary/elementary & high school
Graduate
Illustrations
XI, 180 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 11 mm
Weight
306 gr
ISBN-13
978-1-4612-6925-0 (9781461269250)
DOI
10.1007/978-1-4612-0863-1
Schweitzer Classification
Other editions
Additional editions
E-Book
12/2012
Springer
€66.99
Available for download
Book
01/1994
Springer
€90.94
Shipment within 5-7 days
Person
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".
Content
Preliminaries.- 1 What Is a Turing Machine?.- 2 Computable Partial Functions.- 3 Effective Enumerations.- 4 Computable Numbers and Functions.- 5 Rice's Theorem and the Recursion Theorem.- 6 Abstract Complexity Theory.- Solutions to Exercises.- Solutions for Chapter 1.- Solutions for Chapter 2.- Solutions for Chapter 3.- Solutions for Chapter 4.- Solutions for Chapter 5.- Solutions for Chapter 6.- References.