Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In recursion theory, the mathematical theory of computability, a maximal set is a coinfinite recursively enumerable subset A of the natural numbers such that for every further recursively enumerable subset B of the natural numbers, either B is cofinite or B is a finite variant of A or B is not a superset of A. This gives an easy definition within the lattice of the recursively enumerable sets.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 80 pp. Englisch. N° de réf. du vendeur 9786132630872
Quantité disponible : 2 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In recursiontheory, the mathematical theory of computability, a maximal set is acoinfinite recursively enumerable subset A of the natural numbers suchthat for every further recursively enumerable subset B of the naturalnumbers, either B is cofinite or B is a finite variant of A or B is nota superset of A. This gives an easy definition within the lattice of therecursively enumerable sets. N° de réf. du vendeur 9786132630872
Quantité disponible : 1 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In recursiontheory, the mathematical theory of computability, a maximal set is acoinfinite recursively enumerable subset A of the natural numbers suchthat for every further recursively enumerable subset B of the naturalnumbers, either B is cofinite or B is a finite variant of A or B is nota superset of A. This gives an easy definition within the lattice of therecursively enumerable sets.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 80 pp. Englisch. N° de réf. du vendeur 9786132630872
Quantité disponible : 1 disponible(s)