0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics

Buy Now

Computability - A Mathematical Sketchbook (Paperback, Softcover reprint of the original 1st ed. 1994) Loot Price: R1,440
Discovery Miles 14 400
Computability - A Mathematical Sketchbook (Paperback, Softcover reprint of the original 1st ed. 1994): Douglas S. Bridges

Computability - A Mathematical Sketchbook (Paperback, Softcover reprint of the original 1st ed. 1994)

Douglas S. Bridges

Series: Graduate Texts in Mathematics, 146

 (sign in to rate)
Loot Price R1,440 Discovery Miles 14 400 | Repayment Terms: R135 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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.

General

Imprint: Springer-Verlag New York
Country of origin: United States
Series: Graduate Texts in Mathematics, 146
Release date: July 2013
First published: 1994
Authors: Douglas S. Bridges
Dimensions: 235 x 155 x 11mm (L x W x T)
Format: Paperback
Pages: 180
Edition: Softcover reprint of the original 1st ed. 1994
ISBN-13: 978-1-4612-6925-0
Categories: Books > Science & Mathematics > Mathematics > General
LSN: 1-4612-6925-3
Barcode: 9781461269250

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners