תמונות העטיפה

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

תיאור מלא

שמור ב:
מידע ביבליוגרפי
מחבר ראשי: Supowit, Kenneth J. (Author)
מחבר תאגידי: SpringerLink (Online service)
פורמט: אלקטרוני ספר אלקטרוני
שפה:אנגלית
יצא לאור: Cham : Springer International Publishing : Imprint: Birkhäuser, 2023.
מהדורה:1st ed. 2023.
סדרה:Computer Science Foundations and Applied Logic,
נושאים:
Computer science.
Computable functions.
Recursion theory.
Set theory.
Computer science > Mathematics.
Theory of Computation.
Computability and Recursion Theory.
Set Theory.
Theory and Algorithms for Application Domains.
Mathematics of Computing.
גישה מקוונת:https://doi.org/10.1007/978-3-031-26904-2
תגים: הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
תוכן הענינים:
  • 1 Index of notation and terms
  • 2 Set theory, requirements, witnesses
  • 3 What’s new in this chapter?
  • 4 Priorities (a splitting theorem)
  • 5 Reductions, comparability (Kleene-Post Theorem)
  • 6 Finite injury (Friedberg-Muchnik Theorem)
  • 7 The Permanence Lemma
  • 8 Permitting (Friedberg-Muchnik below C Theorem)
  • 9 Length of agreement (Sacks Splitting Theorem)
  • 10 Introduction to infinite injury
  • 11 A tree of guesses (Weak Thickness Lemma)
  • 12 An infinitely branching tree (Thickness Lemma)
  • 13 True stages (another proof of the Thickness Lemma)
  • 14 Joint custody (Minimal Pair Theorem)
  • 15 Witness lists (Density Theorem)
  • 16 The theme of this book: delaying tactics
  • Appendix A: a pairing function
  • Bibliograph
  • Solutions to selected exercises.

פריטים דומים