• 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
Turing Computability: Theory and Applications

Turing Computability: Theory and Applications

Hardcover

Series: Theory and Applications of Computability

FictionGeneral Computers

ISBN10: 3642319327
ISBN13: 9783642319327
Publisher: Springer
Published: Jun 28 2016
Pages: 263
Weight: 1.31
Height: 0.69 Width: 6.14 Depth: 9.21
Language: English

Turing's famous 1936 paper introduced a formal definition of a computing machine, a Turing machine. This model led to both the development of actual computers and to computability theory, the study of what machines can and cannot compute. This book presents classical computability theory from Turing and Post to current results and methods, and their use in studying the information content of algebraic structures, models, and their relation to Peano arithmetic. The author presents the subject as an art to be practiced, and an art in the aesthetic sense of inherent beauty which all mathematicians recognize in their subject.

1 different editions

Also available

Also from

Soare, Robert I.

Also in

General Computers