Importo totale (1 articolo articoli):
Destinazione ordine:
soare robert (45 risultati)
Vai alla pagina principale dei risultati di ricerca
Filtri di ricerca
Tipo di articolo
- Tutti i tipi di prodotto
- Libri (45)
- Riviste e Giornali (Nessun altro risultato corrispondente a questo perfezionamento)
- Fumetti (Nessun altro risultato corrispondente a questo perfezionamento)
- Spartiti (Nessun altro risultato corrispondente a questo perfezionamento)
- Arte, Stampe e Poster (Nessun altro risultato corrispondente a questo perfezionamento)
- Fotografie (Nessun altro risultato corrispondente a questo perfezionamento)
- Mappe (Nessun altro risultato corrispondente a questo perfezionamento)
- Manoscritti e Collezionismo cartaceo (Nessun altro risultato corrispondente a questo perfezionamento)
Condizioni Maggiori informazioni
Legatura
Ulteriori caratteristiche
- Prima ed. (Nessun altro risultato corrispondente a questo perfezionamento)
- Copia autograf. (Nessun altro risultato corrispondente a questo perfezionamento)
- Sovracoperta (Nessun altro risultato corrispondente a questo perfezionamento)
- Con foto (29)
- Non Print on Demand (36)
Lingua (1)
Spedizione gratuita
Paese del venditore
Valutazione venditore
-
Recursively Enumerable Sets and Degrees : A Study of Computable Functions and Computably Generated Sets
Da: Better World Books, Mishawaka, IN, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: 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.
-
Turing Computability : Theory and Applications
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 67,24
Spedizione EUR 2,26
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Turing Computability: Theory and Applications (Theory and Applications of Computability)
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 69,57
Spedizione gratuita
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Turing Computability : Theory and Applications
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 69,75
Spedizione EUR 2,26
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
-
Turing Computability
Lingua: Inglese
Editore: Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2018
ISBN 10: 3662568586 ISBN 13: 9783662568583
Da: Rarewaves.com USA, London, LONDO, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 72,23
Spedizione gratuita
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback. Condizione: New. Softcover reprint of the original 1st ed. 2016.
-
Turing Computability: Theory and Applications (Theory and Applications of Computability)
Da: Solr Books, Lincolnwood, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: very_good. This books is in Very good condition. There may be a few flaws like shelf wear and some light wear.
-
Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Perspectives in Mathematical Logic)
Da: Solr Books, Lincolnwood, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: 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.
-
Turing Computability: Theory and Applications (Theory and Applications of Computability)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 64,13
Spedizione EUR 13,74
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
Turing Computability : Theory and Applications
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 64,11
Spedizione EUR 17,20
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
hardcover. Condizione: 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!
-
Turing Computability : Theory and Applications
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 72,56
Spedizione EUR 17,20
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: 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.
Da: Antiquariat Bookfarm, Löbnitz, Germania
Valutazione del venditore 5 su 5 stelle
EUR 47,79
Spedizione EUR 40,00
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloHardcover. 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
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 92,78
Spedizione EUR 2,26
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Turing Computability: Theory and Applications (Theory and Applications of Computability)
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 95,11
Spedizione gratuita
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Turing Computability: Theory and Applications (Theory and Applications of Computability)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 87,74
Spedizione EUR 13,74
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Perspectives in Mathematical Logic)
Da: Fireside Bookshop, Stroud, GLOS, Regno Unito
Membro dell'associazione: PBFA
Valutazione del venditore 5 su 5 stelle
EUR 76,76
Spedizione EUR 28,66
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCloth. Condizione: Very Good. Type: Book Small plain label inside cover.
-
Turing Computability : Theory and Applications
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 87,73
Spedizione EUR 17,20
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Perspectives in Mathematical Logic)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 111,74
Spedizione EUR 13,74
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
Turing Computability : Theory and Applications
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 2018
ISBN 10: 3662568586 ISBN 13: 9783662568583
EUR 60,98
Spedizione EUR 62,29
Spedito da Germania a U.S.A.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,25
Spedizione EUR 70,00
Spedito da Germania a U.S.A.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.
-
Turing Computability: Theory and Applications (Theory and Applications of Computability)
Da: Mispah books, Redhill, SURRE, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 107,46
Spedizione EUR 28,66
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: New. New. book.
-
Computability Theory and Applications: The Art of Classical Computability
Lingua: Inglese
Editore: Springer-Verlag New York Inc, 2016
ISBN 10: 3642319327 ISBN 13: 9783642319327
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 126,35
Spedizione EUR 14,33
Spedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 263 pages. 9.25x6.25x0.75 inches. In Stock.
-
EUR 106,16
Spedizione EUR 31,94
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: 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.
-
EUR 78,76
Spedizione EUR 62,30
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrellopaperback. Condizione: Gut. 455 Seiten; 9783540152996.3 Gewicht in Gramm: 1.
-
Turing Computability
Lingua: Inglese
Editore: Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2018
ISBN 10: 3662568586 ISBN 13: 9783662568583
Da: Rarewaves.com UK, London, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 66,96
Spedizione EUR 74,52
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback. Condizione: New. Softcover reprint of the original 1st ed. 2016.
-
Turing Computability : Theory and Applications
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 2016
ISBN 10: 3642319327 ISBN 13: 9783642319327
EUR 85,59
Spedizione EUR 63,09
Spedito da Germania a U.S.A.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.
-
Turing Computability
Lingua: Inglese
Editore: Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 2016, 2016
ISBN 10: 3642319327 ISBN 13: 9783642319327
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
EUR 85,59
Spedizione EUR 60,00
Spedito da Germania a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: 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
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 160,60
Spedizione EUR 17,20
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
-
Turing Computability: Theory and Applications (Theory and Applications of Computability)
Da: Mispah books, Redhill, SURRE, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 151,16
Spedizione EUR 28,66
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Like New. Like New. book.
-
Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Perspectives in Mathematical Logic)
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 166,74
Spedizione EUR 14,33
Spedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 460 pages. 9.30x6.15x1.10 inches. In Stock.
