Kenneth supowit (25 Ergebnisse)
- Hardcover
Anbieter: GreatBookPrices, Columbia, MD, USAGreatBookPrices
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 60,86
EUR 2,27 VersandVersand innerhalb von 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 54,76
EUR 13,94 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In.
- Hardcover
Anbieter: GreatBookPrices, Columbia, MD, USAGreatBookPrices
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Wie neu
EUR 71,10
EUR 2,27 VersandVersand innerhalb von USAAnzahl: Mehr als 20 verfügbar
Zustand: As New. Unread book in perfect condition.
- Hardcover
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes KönigreichGreatBookPricesUK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 66,37
EUR 17,46 VersandVersand von Vereinigtes Königreich nach 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 73,17
EUR 13,94 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In.
- Hardcover
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandKennys Bookshop and Art Galleries Ltd.
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 79,91
EUR 9,50 VersandVersand von Irland nach USAAnzahl: 15 verfügbar
Zustand: New.
- Softcover
Anbieter: Books Puddle, New York, NY, USABooks Puddle
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Neu
EUR 89,55
EUR 3,44 VersandVersand innerhalb von USAAnzahl: 4 verfügbar
Zustand: New. 2023rd edition NO-PA16APR2015-KAP.
- Hardcover
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes KönigreichGreatBookPricesUK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Wie neu
EUR 78,03
EUR 17,46 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: As New. Unread book in perfect condition.
- Softcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 69,83
EUR 30,50 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: 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.
- Hardcover
Anbieter: Revaluation Books, Exeter, Vereinigtes KönigreichRevaluation Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 92,45
EUR 11,64 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 2 verfügbar
Hardcover. Zustand: Brand New. 197 pages. 9.25x6.10x9.21 inches. In Stock.
- Hardcover
Anbieter: Kennys Bookstore, Olney, MD, USAKennys Bookstore
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 98,99
EUR 9,04 VersandVersand innerhalb von USAAnzahl: 15 verfügbar
Zustand: New.
- Softcover
Anbieter: preigu, Osnabrück, Deutschlandpreigu
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 59,40
EUR 70,00 VersandVersand von Deutschland nach USAAnzahl: 5 verfügbar
Taschenbuch. Zustand: 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 Pla…tz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
- Hardcover
Anbieter: Rarewaves.com UK, London, Vereinigtes KönigreichRarewaves.com UK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 79,92
EUR 75,65 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Hardback. Zustand: 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 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 and Engineering, Ohio State University, Columbus, Ohio, US.
- Hardcover
Anbieter: Buchpark, Trebbin, DeutschlandBuchpark
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht
EUR 48,62
EUR 105,00 VersandVersand von Deutschland nach USAAnzahl: 2 verfügbar
Zustand: 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.
- Hardcover
Anbieter: BUCHSERVICE / ANTIQUARIAT Lars Lutzer, Wahlstedt, DeutschlandBUCHSERVICE / ANTIQUARIAT Lars Lutzer
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Gut
EUR 189,00
EUR 39,95 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Hardcover. Zustand: gut. 2023. Algorithms for Constructing Computably Enumerable Sets In deutscher Sprache. pages.
- Softcover
- Print-on-Demand
Anbieter: Brook Bookstore On Demand, Napoli, NA, ItalienBrook Bookstore On Demand
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 54,23
EUR 5,50 VersandVersand von Italien nach USAAnzahl: Mehr als 20 verfügbar
Zustand: new. Questo è un articolo print on demand.
- Hardcover
- Print-on-Demand
Anbieter: Brook Bookstore On Demand, Napoli, NA, ItalienBrook Bookstore On Demand
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 54,23
EUR 5,50 VersandVersand von Italien nach USAAnzahl: Mehr als 20 verfügbar
Zustand: new. Questo è un articolo print on demand.
- Softcover
- Print-on-Demand
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, DeutschlandBuchWeltWeit Ludwig Meier e.K.
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 64,19
EUR 23,00 VersandVersand von Deutschland nach USAAnzahl: 2 verfügbar
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 200 pp. Englisch.
- Hardcover
- Print-on-Demand
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, DeutschlandBuchWeltWeit Ludwig Meier e.K.
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 64,19
EUR 23,00 VersandVersand von Deutschland nach USAAnzahl: 2 verfügbar
Buch. Zustand: 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 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. 200 pp. Englisch.
- Softcover
- Print-on-Demand
Anbieter: Majestic Books, Hounslow, Vereinigtes KönigreichMajestic Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Neu
EUR 89,36
EUR 7,56 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 4 verfügbar
Zustand: New. Print on Demand.
- Softcover
- Print-on-Demand
Anbieter: Biblios, frankfurt am main, HESSE, DeutschlandBiblios
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Neu
EUR 91,90
EUR 9,95 VersandVersand von Deutschland nach USAAnzahl: 4 verfügbar
Zustand: New. PRINT ON DEMAND.
- Hardcover
- Print-on-Demand
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 71,47
EUR 30,50 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Buch. Zustand: Neu. nach der Bestellung gedruckt 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, organ…izes, 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.
- Hardcover
- Print-on-Demand
Anbieter: moluna, Greven, Deutschlandmoluna
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 55,78
EUR 48,99 VersandVersand von Deutschland nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Focuses on algorithmic techniquesPresents algorithms in pseudo-code that is familiar to CS studentsBroadens the appeal and influence of some little-known algorithmsI received an A.B. degree in linguistics from Cornell U…niversity in .
- Softcover
- Print-on-Demand
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschlandbuchversandmimpf2000
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 64,19
EUR 60,00 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. 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 explai…ns, 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.Springer Nature c/o IBS, Benzstrasse 21, 48619 Heek 200 pp. Englisch.
- Hardcover
- Print-on-Demand
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschlandbuchversandmimpf2000
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 64,19
EUR 60,00 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Buch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. 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 explains, org…anizes, 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.Springer Nature c/o IBS, Benzstrasse 21, 48619 Heek 200 pp. Englisch.
