Ordinal Computability: An Introduction to Infinitary Machines

Merlin Carl

Sep 2019 · De Gruyter Series in Logic and Its Applications Kitabu cha 9 · Walter de Gruyter GmbH & Co KG

Kitabu pepe

343

Kurasa

Ukadiriaji na maoni hayajahakikishwa Pata Maelezo Zaidi

Kuhusu kitabu pepe hiki

Ordinal Computability discusses models of computation obtained by generalizing classical models, such as Turing machines or register machines, to transfinite working time and space. In particular, recognizability, randomness, and applications to other areas of mathematics are covered.

Kuhusu mwandishi

Merlin Carl, University of Konstanz, Germany.

Kadiria kitabu pepe hiki

Tupe maoni yako.

Kusoma maelezo

Simu mahiri na kompyuta vibao

Sakinisha programu ya Vitabu vya Google Play kwa ajili ya Android na iPad au iPhone. Itasawazishwa kiotomatiki kwenye akaunti yako na kukuruhusu usome vitabu mtandaoni au nje ya mtandao popote ulipo.

Kompyuta za kupakata na kompyuta

Unaweza kusikiliza vitabu vilivyonunuliwa kwenye Google Play wakati unatumia kivinjari cha kompyuta yako.

Visomaji pepe na vifaa vingine

Ili usome kwenye vifaa vya wino pepe kama vile visomaji vya vitabu pepe vya Kobo, utahitaji kupakua faili kisha ulihamishie kwenye kifaa chako. Fuatilia maagizo ya kina ya Kituo cha Usaidizi ili uhamishe faili kwenye visomaji vya vitabu pepe vinavyotumika.

Ripoti maudhui yanayokiuka sera