Order Total (1 Item Items):
Shipping Destination:
Robert Soare (56 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (56)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (29)
- Not Print on Demand (40)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
Condition: Good. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.
-
Condition: New.
-
-
-
Condition: very_good. This books is in Very good condition. There may be a few flaws like shelf wear and some light wear.
-
Condition: As New. Unread book in perfect condition.
-
Turing Computability: Theory and Applications (Theory and Applications of Computability)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 76.47
US$ 16.38 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Turing Computability
Language: English
Published by Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2018
ISBN 10: 3662568586 ISBN 13: 9783662568583
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
US$ 92.29
Free Shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPaperback. Condition: New. Softcover reprint of the original 1st ed. 2016.
-
Turing Computability : Theory and Applications
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 77.85
US$ 20.51 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Condition: acceptable. This book is in Acceptable condition. All pages are intact, but may have lots of notes, water damage or other issues and be ex library.
-
hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
-
Condition: New.
-
-
Turing Computability : Theory and Applications
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 86.49
US$ 20.51 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Recursively enumerable sets and degrees a study of computable functions and computably generated sets Robert I. Soare. Perspectives in mathematical logic.
Language: English
Published by Berlin, Springer [1987]., 1987
ISBN 10: 3540152997 ISBN 13: 9783540152996
Hardcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 03 SOA 9783540152996 Sprache: Englisch Gewicht in Gramm: 1150.
-
-
Turing Computability: Theory and Applications (Theory and Applications of Computability)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 104.64
US$ 16.38 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Perspectives in Mathematical Logic)
Seller: Fireside Bookshop, Stroud, GLOS, United Kingdom
Association Member: PBFA
Seller rating 5 out of 5 stars
US$ 91.54
US$ 34.18 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketCloth. Condition: Very Good. Type: Book Small plain label inside cover.
-
Turing Computability : Theory and Applications
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 106.02
US$ 20.51 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
-
Condition: New. pp. 430 Index.
-
Turing Computability : Theory and Applications
Language: English
Published by Springer Berlin Heidelberg, 2018
ISBN 10: 3662568586 ISBN 13: 9783662568583
Taschenbuch. Condition: 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.
-
Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Perspectives in Mathematical Logic)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 133.25
US$ 16.38 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
US$ 128.15
US$ 34.18 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: New. New. book.
-
Computability Theory and Applications: The Art of Classical Computability
Language: English
Published by Springer-Verlag New York Inc, 2016
ISBN 10: 3642319327 ISBN 13: 9783642319327
US$ 147.65
US$ 17.09 shipping
Ships from United Kingdom to U.S.A.Quantity: 2 available
Add to basketHardcover. Condition: Brand New. 263 pages. 9.25x6.25x0.75 inches. In Stock.
-
US$ 126.60
US$ 38.09 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketCondition: 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.
-
Turing Computability
Language: English
Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 2016, 2016
ISBN 10: 3642319327 ISBN 13: 9783642319327
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 300 pp. Englisch.
-
Turing Computability : Theory and Applications
Language: English
Published by Springer Berlin Heidelberg, 2016
ISBN 10: 3642319327 ISBN 13: 9783642319327
Buch. Condition: 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.
-
Turing Computability
Language: English
Published by Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2018
ISBN 10: 3662568586 ISBN 13: 9783662568583
US$ 88.52
US$ 88.87 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPaperback. Condition: New. Softcover reprint of the original 1st ed. 2016.
-
Condition: New. pp. 462.
