Algorithms for Constructing Computably Enumerable Sets by Kenneth J. Supowit Har
77,07 €
These algorithms are little-known outside of a niche within the mathematical logic community. · 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.
Jetzt bei Ebay:
