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.

Über den Autor / die Autorin

Merlin Carl, University of Konstanz, Germany.

Produktdetails

• Autoren: Merlin Carl
• Verlag: De Gruyter
• Sprache: Englisch
• Produktform: Fester Einband
• Erschienen: 06.02.2024
• EAN: 9783110495621
• ISBN: 978-3-11-049562-1
• Seiten: 335
• Abmessung: 175 mm x 246 mm x 22 mm
• Gewicht: 716 g
• Illustration: 6 b/w ill., 10 b/w tbl., Gleichungen: ca. 500
• Serien: De Gruyter Series in Logic and Its Applications; De Gruyter Series in Logic and Its Applications, 9
• Thema: Naturwissenschaften, Medizin, Informatik, Technik > Mathematik > Sonstiges