Ordinal Computability: An Introduction to Infinitary Machines (De Gruyter Series in Logic and Its Applications) by Merlin Carl
Requirements: .PDF reader, 6 MB
Overview: 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.
Genre: Non-Fiction > Educational
Download Instructions:
https://userupload.net/lmi4bgrdpg0i
https://drop.download/51xdwflydjdz
Requirements: .PDF reader, 6 MB
Overview: 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.
Genre: Non-Fiction > Educational
Download Instructions:
https://userupload.net/lmi4bgrdpg0i
https://drop.download/51xdwflydjdz