Ordinal Computability : An Introduction to Infinitary Machines, Hardcover by ...
150,01 €
The monograph also studies the concepts of recognizability, degree theory, algorithmic randomness, and complexity theory for infinitary machines. Applications of ordinal computability examine Koepke’s proof of the continuum hypothesis in L using OTMs, the computational proof of Schoenfield’s absoluteness theorem, and an ordinal analogue of Weihrauch reducibility.
Jetzt bei Ebay:
