Description: Recursion Theory : Computational Aspects of Definability, Hardcover by Chong, Chi Tat; Yu, Liang, ISBN 3110275554, ISBN-13 9783110275551, Brand New, Free shipping in the US Chong and Yu introduce recursion theory focusing on the computational aspects of the set of reals and its subsets. They cover fundamental theory, the story of Turing degrees, hyper-arithmetic degrees and perfect set property, and higher randomness theory. Specific topics include hyperarithmetic theory, admissibility and constructability, recursion-theoretic forcing, set theory, the classification of jump operators, basic theorems, independence results in recursion theory, rigidity and bi-interpretability of hyper-degrees, and classical algorithmic randomness. Annotation ©2015 Ringgold, Inc., Portland, OR ()
Price: 258.55 USD
Location: Jessup, Maryland
End Time: 2024-12-08T09:36:56.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 14 Days
Refund will be given as: Money Back
Return policy details:
Book Title: Recursion Theory : Computational Aspects of Definability
Number of Pages: 320 Pages
Language: English
Publication Name: Recursion Theory : Computational Aspects of Definability
Publisher: DE Gruyter, Inc.
Publication Year: 2015
Subject: Information Theory, Computer Science, Logic, Applied
Item Weight: 23.5 Oz
Type: Textbook
Author: Liang Yu, Chi Tat Chong
Item Length: 9.4 in
Subject Area: Mathematics, Computers
Item Width: 6.7 in
Series: De Gruyter Series in Logic and Its Applications Ser.
Format: Hardcover
