ISBN: 9786132630872 - maximal set: recursion theory, recursively enumerable set, natural number, cofinite, automorphism, modulo, simple set, mathematics, isomorphism (3 risultati)

- Brossura
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 136,00
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 80 pp. Englisch.

- Brossura
- Print on Demand
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 143,87
EUR 35,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibile
Taschenbuch. Condizione: 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.…

- Brossura
- Print on Demand
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 136,00
EUR 60,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibile
Taschenbuch. Condizione: 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.…