Supowit (37 risultati)

paperback. Condizione: Very Good. May have light to moderate shelf wear and/or a remainder mark. Complete. Clean pages.

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).

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.

Softcover. Condizione: Fine. Autoren- / zusammenhängende Unterschrift; Leichte Gebrauchsspuren; Leichte Verformung / umgeknickte Seiten; Leichte Verschmutzung / Farbtonveränderung. 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.…

Condizione: As New. Unread book in perfect condition.

Condizione: New. 1st ed. 2023 edition NO-PA16APR2015-KAP.

Softcover. Condizione: Near Fine. First Edition. 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.…

Condizione: New.

Condizione: New.

Condizione: New.

Condizione: New. In English.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New.

Condizione: New.

Condizione: New. In English.

Condizione: As New. Unread book in perfect condition.

Condizione: New. 2023rd edition NO-PA16APR2015-KAP.

Hardcover. Condizione: Brand New. 197 pages. 9.25x6.10x9.21 inches. In Stock.

Condizione: New.

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, 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.…

Buch. 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. …

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 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.…

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.…

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 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.…

Condizione: new. Questo è un articolo print on demand.

Condizione: new. Questo è un articolo print on demand.