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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 80 pp. Englisch. Nº de ref. del artículo: 9786132630872
Cantidad disponible: 2 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: 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 ref. del artículo: 9786132630872
Cantidad disponible: 1 disponibles
Librería: preigu, Osnabrück, Alemania
Taschenbuch. Condición: Neu. Maximal set | Recursion theory, Recursively enumerable set, Natural number, Cofinite, Automorphism, Modulo, Simple set, Mathematics, Isomorphism | Frederic P. Miller (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786132630872 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. Nº de ref. del artículo: 134693790
Cantidad disponible: 5 disponibles
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Taschenbuch. Condición: 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 ref. del artículo: 9786132630872
Cantidad disponible: 1 disponibles