product iamge

Recursion Theory: Computational Aspects of Definability

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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.

Author(s): Chi Tat Chong, Liang Yu
Series: De Gruyter Series in Logic and Its Applications 8
Publisher: de Gruyter
Year: 2015

Language: English
Pages: 306
Tags: Computer Science;AI & Machine Learning;Bioinformatics;Computer Simulation;Cybernetics;Human-Computer Interaction;Information Theory;Robotics;Systems Analysis & Design;Computers & Technology;Applied;Biomathematics;Differential Equations;Game Theory;Graph Theory;Linear Programming;Probability & Statistics;Statistics;Stochastic Modeling;Vector Analysis;Mathematics;Science & Math;Logic;Pure Mathematics;Mathematics;Science & Math;Computer Science;Algorithms;Artificial Intelligence;Database Storage &