Condizione: New.
Condizione: New.
Da: Solr Books, Lincolnwood, IL, U.S.A.
Condizione: very_good. This books is in Very good condition. There may be a few flaws like shelf wear and some light wear.
Da: California Books, Miami, FL, U.S.A.
EUR 69,47
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Condizione: As New. Unread book in perfect condition.
Condizione: New.
Condizione: New.
EUR 72,08
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
EUR 75,95
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: California Books, Miami, FL, U.S.A.
EUR 94,97
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 102,13
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 2018
ISBN 10: 3662568586 ISBN 13: 9783662568583
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 60,98
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
EUR 55,35
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Turing Computability | Theory and Applications | Robert I. Soare | Taschenbuch | xxxvi | Englisch | 2018 | Springer | EAN 9783662568583 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 107,05
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: New. New. book.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 2016
ISBN 10: 3642319327 ISBN 13: 9783642319327
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 85,59
Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: 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.
EUR 159,98
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 150,58
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Like New. Like New. book.
Condizione: As New. Unread book in perfect condition.
Da: preigu, Osnabrück, Germania
EUR 75,70
Quantità: 5 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Turing Computability | Theory and Applications | Robert I. Soare | Buch | xxxvi | Englisch | 2016 | Springer | EAN 9783642319327 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.