Robert i soare (23 Ergebnisse)

- Hardcover
Anbieter: Wonder Book, Frederick, MD, USAWonder Book
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Wie neu
EUR 56,32
Versand gratisVersand innerhalb von USAAnzahl: 1 verfügbar
Zustand: As New. Like New condition. A near perfect copy that may have very minor cosmetic defects.

Sprache: Englisch
Verlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, 1987
- Hardcover
Anbieter: World of Books (was SecondSale), Montgomery, IL, USAWorld of Books (was SecondSale)
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Befriedigend
EUR 79,76
Versand gratisVersand innerhalb von USAAnzahl: 1 verfügbar
Hardback. Zustand: Good. Presents an account of the theory of recursively enumerable degrees. This book is suitable for those interested in logic.

- Softcover
Anbieter: California Books, Miami, FL, USACalifornia Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 79,80
EUR 2,73 VersandVersand innerhalb von USAAnzahl: Mehr als 20 verfügbar
Zustand: New.

- Softcover
Anbieter: Studibuch, Stuttgart, DeutschlandStudibuch
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Gut
EUR 18,83
EUR 62,30 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
paperback. Zustand: Gut. 455 Seiten; 9783540152996.3 Gewicht in Gramm: 1.

- Softcover
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes KönigreichGreatBookPricesUK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 75,98
EUR 17,97 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New.

- Softcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 82,97
EUR 13,43 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In English.

- Softcover
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes KönigreichGreatBookPricesUK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Wie neu
EUR 81,43
EUR 17,97 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: As New. Unread book in perfect condition.

- Hardcover
Anbieter: Fireside Bookshop, Stroud, GLOS, Vereinigtes KönigreichFireside Bookshop
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenVerbandsmitglied: PBFA
Zustand: Gebraucht - Gut
EUR 80,22
EUR 29,95 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Cloth. Zustand: Very Good. Zustand des Schutzumschlags: No d/j as Published. Type: Book Small plain label inside cover.

- Softcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 77,10
EUR 35,00 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: 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.…

- Hardcover
Anbieter: California Books, Miami, FL, USACalifornia Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 120,16
EUR 2,73 VersandVersand innerhalb von USAAnzahl: Mehr als 20 verfügbar
Zustand: New.

- Hardcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 110,81
EUR 13,43 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In English.

- Hardcover
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes KönigreichGreatBookPricesUK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 107,61
EUR 17,97 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New.

- Softcover
Anbieter: preigu, Osnabrück, Deutschlandpreigu
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 59,65
EUR 70,00 VersandVersand von Deutschland nach USAAnzahl: 5 verfügbar
Taschenbuch. Zustand: Neu. Turing Computability | Theory and Applications | Robert I. Soare | Taschenbuch | Theory and Applications of Computability | 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.…

- Softcover
Anbieter: Home-set, Mannheim, DeutschlandHome-set
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 80,24
EUR 49,90 VersandVersand von Deutschland nach USAAnzahl: 2 verfügbar
Softcover/Taschenbuch. Zustand: Neu. 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. Sprache: Englisch Gewicht in Gramm: 458.…

- Hardcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 105,57
EUR 35,00 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Buch. Zustand: 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.…

- Softcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 131,69
EUR 15,37 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In English.

- Softcover
Anbieter: Anybook.com, Lincoln, Vereinigtes KönigreichAnybook.com
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Befriedigend
EUR 110,94
EUR 38,32 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Zustand: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,800grams, ISBN:9783540666813.

- Hardcover
Anbieter: Revaluation Books, Exeter, Vereinigtes KönigreichRevaluation Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 149,20
EUR 14,98 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 2 verfügbar
Hardcover. Zustand: Brand New. 263 pages. 9.25x6.25x0.75 inches. In Stock.

- Hardcover
Anbieter: Home-set, Mannheim, DeutschlandHome-set
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 113,68
EUR 49,90 VersandVersand von Deutschland nach USAAnzahl: 2 verfügbar
Gebundene Ausgabe. Zustand: Neu. 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. Sprache: Englisch Gewicht in Gramm: 565.…

- Softcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 137,38
EUR 35,00 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - .'The book, written by one of the main researchers on the field, gives a complete account of the theory of r.e. degrees. . The definitions, results and proofs are always clearly motivated and explained before the formal presentation; the proofs are described with remarkable clarity and conciseness. The book is highly recommended to everyone interested in logic. It also provides a useful background to computer scientists, in particular to theoretical computer scientists.' Acta Scientiarum Mathematicarum, Ungarn 1988 .'The main purpose of this book is to introduce the reader to the main results and to the intricacies of the current theory for the recurseively enumerable sets and degrees. The author has managed to give a coherent exposition of a rather complex and messy area of logic, and with this book degree-theory is far more accessible to students and logicians in other fields than it used to be.' Zentralblatt für Mathematik, 623.1988.…

- Softcover
Anbieter: Revaluation Books, Exeter, Vereinigtes KönigreichRevaluation Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 178,15
EUR 14,98 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 2 verfügbar
Paperback. Zustand: Brand New. 460 pages. 9.30x6.15x1.10 inches. In Stock.

- Hardcover
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes KönigreichGreatBookPricesUK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Wie neu
EUR 206,09
EUR 17,97 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: As New. Unread book in perfect condition.

- Hardcover
Anbieter: BUCHSERVICE / ANTIQUARIAT Lars Lutzer, Wahlstedt, DeutschlandBUCHSERVICE / ANTIQUARIAT Lars Lutzer
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Gut
EUR 179,90
EUR 39,95 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Zustand: gut. 1987. Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Perspectives in Mathematical Logic) In deutscher Sprache. pages.