Pastāsti draugiem par šo preci:
A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability - Annals of Mathematics Studies Rod Downey
A Hierarchy of Turing Degrees: A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability - Annals of Mathematics Studies
Rod Downey
Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications in topology, group theory, and other subfields. In A Hierarchy of Turing Degrees, Rod Downey and Noam Greenberg introduce
240 pages, 3 b/w illus.
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2020. gada 16. jūnijs |
| ISBN13 | 9780691199665 |
| Izdevēji | Princeton University Press |
| Lapas | 234 |
| Izmēri | 234 × 156 × 17 mm · 378 g |
| Valoda | Angļu |
Ziemassvētku dāvanas var atgriezt līdz 31. janvārim