Supowit (34 risultati)
- Brossura
Da: Magers and Quinn Booksellers, Minneapolis, MN, U.S.A.Magers and Quinn Booksellers
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Molto buono
EUR 8,51
EUR 3,44 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
paperback. Condizione: Very Good. May have light to moderate shelf wear and/or a remainder mark. Complete. Clean pages.
- Brossura
- Firmato
Da: P Peterson Bookseller, Osseo, WI, U.S.A.P Peterson Bookseller
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Molto buono
EUR 11,98
EUR 5,59 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
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).
- Brossura
- Firmato
Da: Kazoo Books LLC, Kalamazoo, MI, U.S.A.Kazoo Books LLC
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Molto buono
EUR 12,42
EUR 5,59 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
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.
Altre immagini- Brossura
- Firmato
Da: Bookbot, Prague, Repubblica CecaBookbot
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Ottimo
EUR 5,80
EUR 20,99 spedizioneSpedito da Repubblica Ceca a U.S.A.Quantità: 1 disponibili
Softcover. 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 beautifu…lly 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.
- Rilegato
Da: Books Puddle, New York, NY, U.S.A.Books Puddle
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 56,77
EUR 3,44 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Condizione: New. 1st ed. 2023 edition NO-PA16APR2015-KAP.
- Rilegato
Da: Majestic Books, Hounslow, Regno UnitoMajestic Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 53,67
EUR 7,56 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Condizione: New.
Editore: Banshee Press, Philadelphia, 2005
- Brossura
- Prima edizione
Da: Between the Covers-Rare Books, Inc. ABAA, Gloucester City, NJ, U.S.A.Between the Covers-Rare Books, Inc. ABAA
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Quasi ottimo
EUR 35,47
EUR 4,74 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloSoftcover. 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, Kelle…y 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.
- Rilegato
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 60,86
EUR 2,27 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
- Rilegato
Da: Biblios, frankfurt am main, HESSE, GermaniaBiblios
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 55,09
EUR 9,95 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Condizione: New.
- Brossura
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 54,76
EUR 13,94 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.
- Rilegato
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 71,10
EUR 2,27 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: As New. Unread book in perfect condition.
- Rilegato
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 66,37
EUR 17,46 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
- Rilegato
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 73,17
EUR 13,94 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.
- Rilegato
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandaKennys Bookshop and Art Galleries Ltd.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 79,91
EUR 9,50 spedizioneSpedito da Irlanda a U.S.A.Quantità: 15 disponibili
Condizione: New.
- Brossura
Da: Books Puddle, New York, NY, U.S.A.Books Puddle
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 89,55
EUR 3,44 spedizioneSpedito in U.S.A.Quantità: 4 disponibili
Condizione: New. 2023rd edition NO-PA16APR2015-KAP.
- Rilegato
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 78,03
EUR 17,46 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: As New. Unread book in perfect condition.
- Brossura
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 69,83
EUR 30,50 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. 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, organi…zes, 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.
- Rilegato
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 92,45
EUR 11,64 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Hardcover. Condizione: Brand New. 197 pages. 9.25x6.10x9.21 inches. In Stock.
- Rilegato
Da: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 98,99
EUR 9,04 spedizioneSpedito in U.S.A.Quantità: 15 disponibili
Condizione: New.
- Brossura
- Edizione Internazionale
Da: UK BOOKS STORE, London, LONDO, Regno UnitoUK BOOKS STORE
Contatta il venditoreVenditore con 5 stelleEdizione InternazionaleCondizione: Nuovo
EUR 114,05
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Condizione: 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 t…he Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.
- Brossura
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 59,40
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. 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.
- Rilegato
Da: Rarewaves.com UK, London, Regno UnitoRarewaves.com UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 79,92
EUR 75,65 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Hardback. Condizione: New. 2023 ed. 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 techniq…ues 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 and Engineering, Ohio State University, Columbus, Ohio, US.
- Rilegato
Da: Buchpark, Trebbin, GermaniaBuchpark
Contatta il venditoreVenditore con 5 stelleCondizione: Usato
EUR 48,62
EUR 105,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Condizione: 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 explain…s, 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.
- Rilegato
Da: BUCHSERVICE / ANTIQUARIAT Lars Lutzer, Wahlstedt, GermaniaBUCHSERVICE / ANTIQUARIAT Lars Lutzer
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Molto buono
EUR 189,00
EUR 39,95 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Hardcover. Condizione: gut. 2023. Algorithms for Constructing Computably Enumerable Sets In deutscher Sprache. pages.
- Brossura
- Print on Demand
Da: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 54,23
EUR 5,50 spedizioneSpedito da Italia a U.S.A.Quantità: Più di 20 disponibili
Condizione: new. Questo è un articolo print on demand.
- Rilegato
- Print on Demand
Da: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 54,23
EUR 5,50 spedizioneSpedito da Italia a U.S.A.Quantità: Più di 20 disponibili
Condizione: new. Questo è un articolo print on demand.
- Brossura
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 64,19
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 200 pp. Englisch.
- Rilegato
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 64,19
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 explain…s, 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. 200 pp. Englisch.
- Brossura
- Print on Demand
Da: Majestic Books, Hounslow, Regno UnitoMajestic Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 89,36
EUR 7,56 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 4 disponibili
Condizione: New. Print on Demand.
- Brossura
- Print on Demand
Da: Biblios, frankfurt am main, HESSE, GermaniaBiblios
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 91,90
EUR 9,95 spedizioneSpedito da Germania a U.S.A.Quantità: 4 disponibili
Condizione: New. PRINT ON DEMAND.
