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.

Info autore

Merlin Carl, University of Konstanz, Germany.

Dettagli sul prodotto

• Autori: Merlin Carl
• Editore: De Gruyter
• Lingue: Inglese
• Formato: Copertina rigida
• Pubblicazione: 06.02.2024
• EAN: 9783110495621
• ISBN: 978-3-11-049562-1
• Pagine: 335
• Dimensioni: 175 mm x 246 mm x 22 mm
• Peso: 716 g
• Illustrazioni: 6 b/w ill., 10 b/w tbl., Gleichungen: ca. 500
• Serie: De Gruyter Series in Logic and Its Applications; De Gruyter Series in Logic and Its Applications, 9
• Categoria: Scienze naturali, medicina, informatica, tecnica > Matematica > Altro