Kenneth Supowit (25 results)
- Hardcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
US$ 68.70
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 63.59
US$ 16.19 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Hardcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
US$ 80.17
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
- Hardcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: New
US$ 77.08
US$ 20.27 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New.
- Hardcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 84.98
US$ 16.19 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Hardcover
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrelandKennys Bookshop and Art Galleries Ltd.
Contact seller5-star sellerCondition: New
US$ 95.59
US$ 11.03 shippingShips from Ireland to U.S.A.Quantity: 15 available
Condition: New.
- Softcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
US$ 100.97
US$ 3.99 shippingShips within U.S.A.Quantity: 4 available
Condition: New. 2023rd edition NO-PA16APR2015-KAP.
- Hardcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: Used - As new
US$ 90.63
US$ 20.27 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 83.53
US$ 35.42 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: 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, organiz…es, 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
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
US$ 107.37
US$ 13.52 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Hardcover. Condition: Brand New. 197 pages. 9.25x6.10x9.21 inches. In Stock.
- Hardcover
Seller: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contact seller5-star sellerCondition: New
US$ 111.62
US$ 10.50 shippingShips within U.S.A.Quantity: 15 available
Condition: New.
- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 71.05
US$ 81.30 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: 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 P…latz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
- Hardcover
Seller: Rarewaves.com UK, London, United KingdomRarewaves.com UK
Contact seller5-star sellerCondition: New
US$ 92.82
US$ 87.86 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Hardback. Condition: 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 techniqu…es 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
Seller: Buchpark, Trebbin, GermanyBuchpark
Contact seller5-star sellerCondition: Used
US$ 58.16
US$ 121.95 shippingShips from Germany to U.S.A.Quantity: 2 available
Condition: 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
Seller: BUCHSERVICE / ANTIQUARIAT Lars Lutzer, Wahlstedt, GermanyBUCHSERVICE / ANTIQUARIAT Lars Lutzer
Contact seller5-star sellerCondition: Used - Very good
US$ 226.09
US$ 46.40 shippingShips from Germany to U.S.A.Quantity: 1 available
Hardcover. Condition: gut. 2023. Algorithms for Constructing Computably Enumerable Sets In deutscher Sprache. pages.
- Softcover
- Print on Demand
Seller: Brook Bookstore On Demand, Napoli, NA, ItalyBrook Bookstore On Demand
Contact seller5-star sellerCondition: New
US$ 64.88
US$ 6.39 shippingShips from Italy to U.S.A.Quantity: Over 20 available
Condition: new. Questo è un articolo print on demand.
- Hardcover
- Print on Demand
Seller: Brook Bookstore On Demand, Napoli, NA, ItalyBrook Bookstore On Demand
Contact seller5-star sellerCondition: New
US$ 64.88
US$ 6.39 shippingShips from Italy to U.S.A.Quantity: Over 20 available
Condition: new. Questo è un articolo print on demand.
Language: English
Published by Springer International Publishing Jun 2024, 2024
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
US$ 76.79
US$ 26.71 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 200 pp. Englisch.
Language: English
Published by Springer International Publishing Mai 2023, 2023
- Hardcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
US$ 76.79
US$ 26.71 shippingShips from Germany to U.S.A.Quantity: 2 available
Buch. Condition: 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
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: New
US$ 100.76
US$ 8.79 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
Condition: New. Print on Demand.
- Softcover
- Print on Demand
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: New
US$ 109.94
US$ 11.56 shippingShips from Germany to U.S.A.Quantity: 4 available
Condition: New. PRINT ON DEMAND.
- Hardcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 85.49
US$ 35.42 shippingShips from Germany to U.S.A.Quantity: 1 available
Buch. Condition: 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, 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. Supowitis an Associate Professor Emeritus, Department of Computer Science & Engineering, Ohio State University, Columbus, Ohio, US.
- Hardcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
US$ 66.72
US$ 56.90 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: 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… University in .
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
US$ 76.79
US$ 69.68 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: 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 expl…ains, 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
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
US$ 76.79
US$ 69.68 shippingShips from Germany to U.S.A.Quantity: 1 available
Buch. Condition: 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, o…rganizes, 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.
