Ordinal Computability - An Introduction to Infinitary Machines

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.

A propos de l'auteur

Merlin Carl, University of Konstanz, Germany.

Détails du produit

• Auteurs: Merlin Carl
• Edition: De Gruyter
• Langues: Anglais
• Format d'édition: Livre Relié
• Sortie: 06.02.2024
• EAN: 9783110495621
• ISBN: 978-3-11-049562-1
• Pages: 335
• Dimensions: 175 mm x 246 mm x 22 mm
• Poids: 716 g
• Illustrations: 6 b/w ill., 10 b/w tbl., Gleichungen: ca. 500
• Thèmes: De Gruyter Series in Logic and Its Applications; De Gruyter Series in Logic and Its Applications, 9
• Catégorie: Sciences naturelles, médecine, informatique, technique > Mathématiques > Autres