Importo totale (1 articolo articoli):
Destinazione ordine:
supowit (37 risultati)
Vai alla pagina principale dei risultati di ricerca
Filtri di ricerca
Tipo di articolo
- Tutti i tipi di prodotto
- Libri (37)
- 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
- Nuovo (29)
- Come nuovo, Ottimo o Quasi ottimo (4)
- Molto buono o Buono (3)
- Discreto o Mediocre (Nessun altro risultato corrispondente a questo perfezionamento)
- Come descritto (1)
Legatura
Ulteriori caratteristiche
- Prima ed. (1)
- Copia autograf. (3)
- Sovracoperta (Nessun altro risultato corrispondente a questo perfezionamento)
- Con foto (12)
- Non Print on Demand (26)
Lingua (2)
Spedizione gratuita
Paese del venditore
Valutazione venditore
-
Halves of Necessity
Da: Magers and Quinn Booksellers, Minneapolis, MN, U.S.A.
Valutazione del venditore 5 su 5 stelle
paperback. Condizione: Very Good. May have light to moderate shelf wear and/or a remainder mark. Complete. Clean pages.
-
Halves of Necessity: A Book of Poems
Lingua: Inglese
Editore: Plain View Pr, Austin, Texas, U.S.A., 1999
ISBN 10: 1891386085 ISBN 13: 9781891386084
Da: P Peterson Bookseller, Osseo, WI, U.S.A.
Valutazione del venditore 5 su 5 stelle
Copia autografata
Trade Paperback. Condizione: Very Good. No Jacket. The author wrote a short note to a previous owner and signed the title page, with love, Sandy. Signed by Author(s).
-
Halves of Necessity
Da: Kazoo Books LLC, Kalamazoo, MI, U.S.A.
Valutazione del venditore 5 su 5 stelle
Copia autografata
Trade Paperback. Condizione: Collectible - Very Good. No Jacket. Blue photographic covers with blue spine. Signed by author on title page. 9x6 with 95 pages. Signed.
-
Halves of Necessity (Autoren- / zusammenhängende Unterschrift)
Copia autografata
EUR 8,38
Spedizione EUR 20,99
Spedito da Repubblica Ceca a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloSoftcover. Condizione: Fine. Autoren- / zusammenhängende Unterschrift; Abnutzung / Risse - leicht; Gebrochener Buchrücken / Seiten oder Softcover umgeknickt; Vergilbt / ausgeblichen. These poems express the complete range of human emotion, from blackest despair to soaring joy, and always in unflinching honesty. They are beautifully crafted and easily accessible. This is a triumphant story of transformation -- from abused, overweight, insecure woman to confident, successful educator, writer, wife and community activist.
-
ALGORITHMS FOR CONSTRUCTING COMPUTABLY ENUMERABLE SETS
Da: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
-
Algorithms for Constructing Computably Enumerable Sets
Da: Basi6 International, Irving, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
-
Algorithms for Constructing Computably Enumerable Sets (Computer Science Foundations and Applied Logic)
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. 1st ed. 2023 edition NO-PA16APR2015-KAP.
-
Condizione: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
-
Algorithms for Constructing Computably Enumerable Sets (Computer Science Foundations and Applied Logic)
Da: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 54,33
Spedizione EUR 7,64
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New.
-
One Trick Pony: Number Eleven, Winter '05
Editore: Banshee Press, Philadelphia, 2005
Da: Between the Covers-Rare Books, Inc. ABAA, Gloucester City, NJ, U.S.A.
Membro dell'associazione: ABAA ESA ILAB IOBA
Valutazione del venditore 5 su 5 stelle
Prima edizione
Softcover. Condizione: Near Fine. First edition. Stapled wrappers. 84pp. Check marks on rear wrapper and page 58, a couple of pages dog-eared, near fine. Poetry by Ann E. Michael, James P. Lenfestey, Jim Daniels, Jim Freeman, Livio Farallo, Rochelle Ratner, Jeanne Murray Walker, Julie Lechevsky, Richard Bank, April Linder, Kelley Jean White, Bruce Dethlefsen, Gina Conti, Peter Krok, Alan Catlin, Marilyn Bates, Robert L. Penick, B.Z. Niditch, Gayle Elen Harvey, Dennis Harrell, Robin Merrill, Joanne Lowery, Cathryn Cofell, Sandy Supowit, Len Roberts, Dennis Donaghy, Margaret A. Robinson, John Grey, Robin Becker, Ann A. Boger, Jenny Browne, Albert Huffstickler.
-
Algorithms for Constructing Computably Enumerable Sets
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 60,85
Spedizione EUR 2,31
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Algorithms for Constructing Computably Enumerable Sets (Computer Science Foundations and Applied Logic)
Da: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 4 su 5 stelle
EUR 54,52
Spedizione EUR 9,95
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New.
-
Algorithms for Constructing Computably Enumerable Sets
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 55,33
Spedizione EUR 14,09
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
Algorithms for Constructing Computably Enumerable Sets
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 72,20
Spedizione EUR 2,31
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
-
Algorithms for Constructing Computably Enumerable Sets (Computer Science Foundations and Applied Logic)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 73,93
Spedizione EUR 14,09
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
Algorithms for Constructing Computably Enumerable Sets
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 73,92
Spedizione EUR 17,64
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Algorithms For Constructing Computably E
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Valutazione del venditore 5 su 5 stelle
EUR 79,91
Spedizione EUR 10,50
Spedito da Irlanda a U.S.A.Quantità: 15 disponibili
Aggiungi al carrelloCondizione: New.
-
Algorithms for Constructing Computably Enumerable Sets (Computer Science Foundations and Applied Logic)
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. 2023rd edition NO-PA16APR2015-KAP.
-
Algorithms for Constructing Computably Enumerable Sets
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 79,66
Spedizione EUR 17,64
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
-
Algorithms for Constructing Computably Enumerable Sets
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 93,61
Spedizione EUR 11,76
Spedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 197 pages. 9.25x6.10x9.21 inches. In Stock.
-
Algorithms For Constructing Computably E
Da: Kennys Bookstore, Olney, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New.
-
Edizione InternazionaleALGORITHMS FOR CONSTRUCTING COMPUTABLY ENUMERABLE SETS (PB 2023)
Da: UK BOOKS STORE, London, LONDO, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 113,89
Spedizione gratuita
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. Brand New! Fast Delivery This is an International Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 6-10 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.
-
Algorithms for Constructing Computably Enumerable Sets
Lingua: Inglese
Editore: Springer International Publishing, 2024
ISBN 10: 3031269063 ISBN 13: 9783031269066
EUR 64,19
Spedizione EUR 61,56
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Logicians have developed beautiful algorithmic techniques for the construction of computably enumerable sets.This textbook presents these techniques in a unified way that should appeal to computer scientists.Specifically, the book explains, organizes, and compares various algorithmic techniques used in computability theory (which was formerly called 'classical recursion theory').This area of study has produced some of the most beautiful and subtle algorithms ever developed for any problems.These algorithms are little-known outside of a niche within the mathematical logic community.By presenting them in a style familiar to computer scientists, the intent is to greatly broaden their influence and appeal.Topics and features: All other books in this field focus on the mathematical results, rather than on the algorithms. There are many exercises here, most of which relate to details of the algorithms. The proofs involving priority trees are written here in greater detail, and with more intuition, than can be found elsewhere in the literature. The algorithms are presented in a pseudocode very similar to that used in textbooks (such as that by Cormen, Leiserson, Rivest, and Stein) on concrete algorithms. In addition to their aesthetic value, the algorithmic ideas developed for these abstract problems might find applications in more practical areas.Graduate students in computer science or in mathematical logic constitute the primary audience. Furthermore, when the author taught a one-semester graduate course based on this material, a number of advanced undergraduates, majoring in computer science or mathematics or both, took the course and flourished in it.Kenneth J. Supowitis an Associate Professor Emeritus, Department of Computer Science & Engineering, Ohio State University, Columbus, Ohio, US.
-
Algorithms for Constructing Computably Enumerable Sets
Lingua: Inglese
Editore: Springer International Publishing, 2023
ISBN 10: 3031269039 ISBN 13: 9783031269035
EUR 64,19
Spedizione EUR 62,36
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Logicians have developed beautiful algorithmic techniques for the construction of computably enumerable sets.This textbook presents these techniques in a unified way that should appeal to computer scientists.Specifically, the book explains, organizes, and compares various algorithmic techniques used in computability theory (which was formerly called 'classical recursion theory').This area of study has produced some of the most beautiful and subtle algorithms ever developed for any problems.These algorithms are little-known outside of a niche within the mathematical logic community.By presenting them in a style familiar to computer scientists, the intent is to greatly broaden their influence and appeal.Topics and features: All other books in this field focus on the mathematical results, rather than on the algorithms. There are many exercises here, most of which relate to details of the algorithms. The proofs involving priority trees are written here in greater detail, and with more intuition, than can be found elsewhere in the literature. The algorithms are presented in a pseudocode very similar to that used in textbooks (such as that by Cormen, Leiserson, Rivest, and Stein) on concrete algorithms. In addition to their aesthetic value, the algorithmic ideas developed for these abstract problems might find applications in more practical areas.Graduate students in computer science or in mathematical logic constitute the primary audience. Furthermore, when the author taught a one-semester graduate course based on this material, a number of advanced undergraduates, majoring in computer science or mathematics or both, took the course and flourished in it.Kenneth J. Supowitis an Associate Professor Emeritus, Department of Computer Science & Engineering, Ohio State University, Columbus, Ohio, US.
-
EUR 59,40
Spedizione EUR 70,00
Spedito da Germania a U.S.A.Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Algorithms for Constructing Computably Enumerable Sets | Kenneth J. Supowit | Taschenbuch | Computer Science Foundations and Applied Logic | xiv | Englisch | 2024 | Springer | EAN 9783031269066 | Verantwortliche Person für die EU: Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
-
EUR 48,62
Spedizione EUR 105,00
Spedito da Germania a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloCondizione: Hervorragend. Zustand: Hervorragend | Sprache: Englisch | Produktart: Bücher | Logicians have developed beautiful algorithmic techniques for the construction of computably enumerable sets. This textbook presents these techniques in a unified way that should appeal to computer scientists.Specifically, the book explains, organizes, and compares various algorithmic techniques used in computability theory (which was formerly called "classical recursion theory"). This area of study has produced some of the most beautiful and subtle algorithms ever developed for any problems. These algorithms are little-known outside of a niche within the mathematical logic community. By presenting them in a style familiar to computer scientists, the intent is to greatly broaden their influence and appeal.Topics and features:· All other books in this field focus on the mathematical results, rather than on the algorithms.· There are many exercises here, most of which relate to details of the algorithms.· The proofs involving priority trees are written here in greater detail, and with more intuition, than can be found elsewhere in the literature.· The algorithms are presented in a pseudocode very similar to that used in textbooks (such as that by Cormen, Leiserson, Rivest, and Stein) on concrete algorithms.· In addition to their aesthetic value, the algorithmic ideas developed for these abstract problems might find applications in more practical areas.Graduate students in computer science or in mathematical logic constitute the primary audience. Furthermore, when the author taught a one-semester graduate course based on this material, a number of advanced undergraduates, majoring in computer science or mathematics or both, took the course and flourished in it.Kenneth J. Supowit is an Associate Professor Emeritus, Department of Computer Science & Engineering, Ohio State University, Columbus, Ohio, US.
-
Algorithms for Constructing Computably Enumerable Sets (eng)
Da: Brook Bookstore On Demand, Napoli, NA, Italia
Valutazione del venditore 5 su 5 stelle
EUR 54,23
Spedizione EUR 5,50
Spedito da Italia a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: new. Questo è un articolo print on demand.
-
Algorithms for Constructing Computably Enumerable Sets (eng)
Da: Brook Bookstore On Demand, Napoli, NA, Italia
Valutazione del venditore 5 su 5 stelle
EUR 54,23
Spedizione EUR 5,50
Spedito da Italia a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: new. Questo è un articolo print on demand.
-
Algorithms for Constructing Computably Enumerable
Da: Basi6 International, Irving, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 64,84
Spedizione gratuita
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: Brand New. New. US edition. Print on demand title. Delivery takes 20-25 days.
-
Algorithms for Constructing Computably Enumerable
Da: Basi6 International, Irving, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Brand New. New. US edition. Print on demand title. Delivery takes 20-25 days.
