• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Computability: A Mathematical Sketchbook

Computability: A Mathematical Sketchbook

Hardcover

Series: Graduate Texts in Mathematics, Book 146

FictionGeneral Computers

ISBN10: 0387941746
ISBN13: 9780387941745
Publisher: Springer
Published: Jan 14 1994
Pages: 180
Weight: 1.06
Height: 0.71 Width: 6.29 Depth: 9.57
Language: English
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.

1 different editions

Also available

Also from

Bridges, Douglas S.

Also in

Fiction