Recursion Theory: Computational Aspects of Definability
Chi Tat Chong, Liang Yu, "Recursion Theory: Computational Aspects of Definability"
2015 | ISBN-10: 3110275554 | 306 pages | PDF | 2 MB

This monograph presents recursion theory from a generalized and largely global point of view. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using ideas and techniques beyond those of classical recursion theory. These include structure theory, hyperarithmetic determinacy and rigidity, basis theorems, independence results on Turing degrees, as well as applications to higher randomness.
Download link:
Links are Interchangeable - Single Extraction - Premium is support resumable

Alternate Link for Recursion Theory: Computational Aspects of Definability.rar When above links are dead

Hello Respective Visitor!

Please Login or Create a FREE Account to gain accesss to hidden contents.


Would you like to leave your comment? Please Login to your account to leave comments. Don't have an account? You can create a free account now.