EUR 62,02
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
EUR 64,69
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 63,47
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : California Books, Miami, FL, Etats-Unis
EUR 71,75
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : Solr Books, Lincolnwood, IL, Etats-Unis
EUR 65,55
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : very_good. This books is in Very good condition. There may be a few flaws like shelf wear and some light wear.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 67,94
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 65,08
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 67,93
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 87,38
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Edité par Springer Berlin Heidelberg, 2018
ISBN 10 : 3662568586 ISBN 13 : 9783662568583
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 60,98
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.Part I gives a thorough development of the foundations of computability, from the definition of Turing machines up to finite injury priority arguments. Key topics include relative computability, and computably enumerable sets, those which can be effectively listed but not necessarily effectively decided, such as the theorems of Peano arithmetic. Part IIincludes the study of computably open and closed sets of reals and basis and nonbasis theorems for effectively closed sets. Part III covers minimal Turing degrees. Part IV is an introduction to games and their use in proving theorems. Finally, Part V offers a short history of computability theory.The author has honed the content over decades according to feedback from students, lecturers, and researchers around the world. Most chapters include exercises, and the material is carefully structured according to importance and difficulty. The book is suitable for advanced undergraduate and graduate students in computer science and mathematics and researchers engaged with computability and mathematical logic.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 93,16
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Vendeur : California Books, Miami, FL, Etats-Unis
EUR 107,17
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Edité par Springer Berlin Heidelberg, 2016
ISBN 10 : 3642319327 ISBN 13 : 9783642319327
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 85,59
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierBuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.Part I gives a thorough development of the foundations of computability, from the definition of Turing machines up to finite injury priority arguments. Key topics include relative computability, and computably enumerable sets, those which can be effectively listed but not necessarily effectively decided, such as the theorems of Peano arithmetic. Part IIincludes the study of computably open and closed sets of reals and basis and nonbasis theorems for effectively closed sets. Part III covers minimal Turing degrees. Part IV is an introduction to games and their use in proving theorems. Finally, Part V offers a short history of computability theory.The author has honed the content over decades according to feedback from students, lecturers, and researchers around the world. Most chapters include exercises, and the material is carefully structured according to importance and difficulty. The book is suitable for advanced undergraduate and graduate students in computer science and mathematics and researchers engaged with computability and mathematical logic.
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
EUR 110,36
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : New. New. book.
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
EUR 150,39
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Like New. Like New. book.