# Recursion theory: Trending topics

Advertisements

The following are the current most viewed articles on Wikipedia within Wikipedia's Recursion theory category. Think of it as a What's Hot list for Recursion theory. More info »

This is a beta release and so the figures may be a day or two out of date. We'd love to get your thoughts.

Rank Topic Wikipedia views
1 Turing machine 2,847
2 Lambda calculus 2,078
3 Computation 1,240
4 Church–Turing thesis 1,233
5 Entscheidungsproblem 1,153
6 Recursion (computer science) 1,135
7 Decision problem 1,068
8 Computability theory 933
9 Halting problem 900
10 Ackermann function 745
11 Algorithm examples 600
12 Effective method 583
13 Kolmogorov complexity 428
14 Busy beaver 393
15 Computable function 361
16 Primitive recursive function 292
17 Algorithm characterizations 252
18 Turing degree 207
19 Oracle machine 196
20 Recursively enumerable set 182
21 Computable number 169
22 Von Neumann universal constructor 167
23 Recursive language 130
24 Recursive set 107
25 List of undecidable problems 94
26 Μ-recursive function 89
27 Reverse mathematics 64
28 Arithmetical hierarchy 63
29 Post correspondence problem 60
30 Kleene's recursion theorem 58
31 ELEMENTARY 57
32 Turing reduction 54
33 König's lemma 42
34 Many-one reduction 38
35 Μ operator 37
36 Smn theorem 32
37 Fast-growing hierarchy 31
38 History of the Church–Turing thesis 28
39 Reduction (recursion theory) 27
40 Analytical hierarchy 25
41 Arithmetical set 25
42 Course-of-values recursion 22
43 Computability logic 21
44 Truth-table reduction 20
45 Effective dimension 20
46 Church–Turing–Deutsch principle 18
47 Richardson's theorem 18
48 Bounded quantifier 18
49 McCarthy Formalism 18
50 Gödel numbering for sequences 18
51 Maximal set 18
52 Chain rule for Kolmogorov complexity 16
53 Automatic group 16
54 Grzegorczyk hierarchy 16
55 Post's theorem 15
56 Index set (recursion theory) 15
57 Double recursion 15
58 Alpha recursion theory 14
59 Recursive languages and sets 14
60 List of computability and complexity topics 13
61 Numbering (computability theory) 13
62 Computable analysis 13
63 Myhill isomorphism theorem 12
64 Craig's theorem 12
65 Utm theorem 11
66 Recursive ordinal 11
67 Hyperarithmetical theory 11
68 PA degree 11
69 Recursively inseparable sets 10
70 Computation in the limit 9
71 Description number 9
72 Turing jump 8
73 Simple set 7
74 Tarski–Kuratowski algorithm 7
75 Low (computability) 7
76 High (computability) 7
77 Computable isomorphism 6
78 Kleene's T predicate 6
79 Büchi's Problem 6
80 Hardy hierarchy 6
81 Complete numbering less than 5 views
82 Low basis theorem less than 5 views
83 Effective Polish space less than 5 views
84 Π01 class less than 5 views
85 Computable measure theory less than 5 views
86 Computability and complexity topics less than 5 views
87 Undecidable problems less than 5 views
88 Creative and productive sets less than 5 views
89 Trakhtenbrot's theorem less than 5 views
90 Martin measure less than 5 views
91 Forcing (recursion theory) less than 5 views
92 Automatic semigroup less than 5 views
93 Primitive recursive functional less than 5 views
94 Slow-growing hierarchy less than 5 views

# Encyclopedia

### From Wikipedia, the free encyclopedia

This category is for articles about recursion theory, also called computability theory, which is a branch of mathematical logic concerned with generalizations of the notion of computable function, and with related concepts such as Turing degrees.

Related information about computability theory in computer science is described in the theory of computation article and is categorized in Category:Theory of computation

The main article for this category is Recursion theory.

## Subcategories

This category has the following 6 subcategories, out of 6 total.

## Pages in category "Recursion theory"

The following 99 pages are in this category, out of 99 total. This list may not reflect recent changes (learn more).

### Μ

Advertisements

 Got something to say? Make a comment. Your name Your email address Message