Gå direkte til innholdet
Turing Computability
Spar

Turing Computability

Turing's famous 1936 paper introduced a formal definition of a computing machine, a Turing machine. 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.

Undertittel
Theory and Applications
Opplag
Softcover reprint of the original 1st ed. 2016
ISBN
9783662568583
Språk
Engelsk
Vekt
310 gram
Utgivelsesdato
7.6.2018
Antall sider
263