# Theory of computation: Trending topics

Advertisements

The following are the current most viewed articles on Wikipedia within Wikipedia's Theory of computation category. Think of it as a What's Hot list for Theory of computation. 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 Recursion 5,336
2 Church–Turing thesis 1,233
3 Recurrence relation 1,223
4 Entscheidungsproblem 1,153
5 Turing completeness 1,100
6 Halting problem 900
7 Ackermann function 745
8 Nondeterministic algorithm 737
9 Theory of computation 729
10 Self-reference 646
11 Effective method 583
12 Tail recursion 545
13 Nomogram 528
14 List of unsolved problems in computer science 454
15 Busy beaver 393
16 Computable function 361
17 Computability 303
18 Primitive recursive function 292
19 Byzantine fault tolerance 255
20 Digital physics 234
21 Model of computation 219
22 Turing degree 207
23 Two Generals' Problem 189
24 Recursively enumerable set 182
25 Gödel numbering 177
26 Computable number 169
27 Hypercomputation 155
28 Typed lambda calculus 141
29 Chaitin's constant 133
30 Recursive language 130
31 Recursive set 107
32 Recursively enumerable language 103
33 Rice's theorem 102
34 Simply typed lambda calculus 98
35 Wang tile 97
36 List of undecidable problems 94
37 Μ-recursive function 89
38 Powerset construction 89
39 First Draft of a Report on the EDVAC 62
40 Post correspondence problem 60
41 Extended finite state machine 60
42 Object-capability model 55
43 X-machine 48
44 Markov algorithm 47
45 Semi-Thue system 46
46 Computational semiotics 41
47 Quantum Byzantine agreement 41
48 Limits to computation 37
49 Real computation 34
50 Mutual recursion 32
51 Smn theorem 32
52 Interactive computation 31
53 History of the Church–Turing thesis 28
54 Blockhead (computer system) 27
55 Introduction to the Theory of Computation 26
56 Undefined value 26
57 Scale factor (computer science) 25
58 Bremermann's limit 24
59 Omega language 22
60 Super-recursive algorithm 21
61 Stream X-Machine 19
62 Church–Turing–Deutsch principle 18
63 Mortality (computability theory) 17
64 Chain rule for Kolmogorov complexity 16
65 Rice–Shapiro theorem 16
66 Algorithmic game theory 16
67 Computation history 15
68 Small step semantics 14
69 Recursive languages and sets 14
70 Shadow square 14
71 List of computability and complexity topics 13
72 Numbering (computability theory) 13
73 Utm theorem 11
74 X-Machine Testing 11
75 Circuit (computer theory) 11
76 Ten15 10
77 Sudan function 10
78 Two-way deterministic finite automaton 10
79 Acceptable programming system 9
80 Computation in the limit 9
81 Turing's proof 9
82 Description number 9
83 Rogers' equivalence theorem 8
84 Cylindrification 8
85 Brooks–Iyengar algorithm 8
86 Parallel terraced scan 7
87 Tarski–Kuratowski algorithm 7
88 Parallel computation thesis 7
89 Yao's test 7
90 Computable isomorphism 6
91 Communicating X-Machine 6
92 Range problem less than 5 views
93 Computability and complexity topics less than 5 views
94 Unsolved problems in computer science less than 5 views
95 Undecidable problems less than 5 views
96 Cylindric numbering less than 5 views

# Encyclopedia

### From Wikipedia, the free encyclopedia

This category is for articles about theory of computation, which is a branch of computer science.

Related information about computability theory in mathematical logic is described in the recursion theory article and is categorized in Category:Recursion theory.

## Subcategories

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

## Pages in category "Theory of computation"

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

### Μ

Advertisements

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