Haben Sie Fragen? Einfach anrufen, wir helfen gerne: Tel. 089/210233-0
oder besuchen Sie unser Ladengeschäft in der Pacellistraße 5 (Maxburg) 80333 München
+++ Versandkostenfreie Lieferung innerhalb Deutschlands
Haben Sie Fragen? Tel. 089/210233-0

Algorithms for Constructing Computably Enumerable Sets

64,19 €*

Sofort verfügbar, Lieferzeit: 1-3 Tage

Produktnummer: 18d196ae20e4d449dbad0d1f36a110b309
Produktinformationen "Algorithms for Constructing Computably Enumerable Sets"
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.
Bücherregal gefüllt mit juristischen Werken

Sie möchten lieber vor Ort einkaufen?

Sie haben Fragen zu diesem oder anderen Produkten oder möchten einfach gerne analog im Laden stöbern? Wir sind gerne für Sie da und beraten Sie auch telefonisch.

Juristische Fachbuchhandlung
Georg Blendl

Parcellistraße 5 (Maxburg)
8033 München

Montag - Freitag: 8:15 -18 Uhr
Samstags geschlossen