Items related to Maximal set: Recursion theory, Recursively enumerable...
Maximal set: Recursion theory, Recursively enumerable set, Natural number, Cofinite, Automorphism, Modulo, Simple set, Mathematics, Isomorphism - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
Reseña del editor
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.
"About this title" may belong to another edition of this title.
Search results for Maximal set: Recursion theory, Recursively enumerable...
Stock Image
Maximal set
Print on DemandSeller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 80 pp. Englisch. Seller Inventory # 9786132630872
Buy New
US$ 158.86
US$ 26.08 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 2 available
Seller Image
Maximal set : Recursion theory, Recursively enumerable set, Natural number, Cofinite, Automorphism, Modulo, Simple set, Mathematics, Isomorphism
Print on DemandSeller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9786132630872
Buy New
US$ 160.76
US$ 39.69 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available
Seller Image
Maximal set | Recursion theory, Recursively enumerable set, Natural number, Cofinite, Automorphism, Modulo, Simple set, Mathematics, Isomorphism
Print on DemandSeller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 134693790
Buy New
US$ 128.32
US$ 79.38 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 5 available
Seller Image
Maximal set
Print on DemandSeller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9786132630872
Buy New
US$ 158.86
US$ 68.04 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available