Vietnamese
French
Bengali
পরিগণনীয়তা তত্ত্ব (কম্পিউটার বিজ্ঞান)
Cited by user Fairuza Laila on
English
Turing Computability
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 Defining Computability
-
Altmetric BadgeChapter 2 Computably Enumerable Sets
-
Altmetric BadgeChapter 3 Turing Reducibility
-
Altmetric BadgeChapter 4 The Arithmetical Hierarchy
-
Altmetric BadgeChapter 5 Classifying C.E. Sets
-
Altmetric BadgeChapter 6 Oracle Constructions and Forcing
-
Altmetric BadgeChapter 7 The Finite Injury Method
-
Altmetric BadgeChapter 8 Open and Closed Classes
-
Altmetric BadgeChapter 9 Basis Theorems
-
Altmetric BadgeChapter 10 Peano Arithmetic and $$\Pi_1^0$$ -Classes
-
Altmetric BadgeChapter 11 Randomness and $$\Pi_1^0$$ -Classes
-
Altmetric BadgeChapter 12 Minimal Degrees Below $$\emptyset^{\prime\prime}$$
-
Altmetric BadgeChapter 13 Minimal Degrees Below $$\emptyset^{\prime}$$
-
Altmetric BadgeChapter 14 Banach-Mazur Games
-
Altmetric BadgeChapter 15 Gale-Stewart Games
-
Altmetric BadgeChapter 16 More Lachlan Games
-
Altmetric BadgeChapter 17 History of Computability