Articoli correlati a Maximal set: Recursion theory, Recursively enumerable...

Maximal set: Recursion theory, Recursively enumerable set, Natural number, Cofinite, Automorphism, Modulo, Simple set, Mathematics, Isomorphism - Brossura

 
9786132630872: Maximal set: Recursion theory, Recursively enumerable set, Natural number, Cofinite, Automorphism, Modulo, Simple set, Mathematics, Isomorphism

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.