529:
377:
226:
539:
362:
121:
507:
80:
898:
903:
478:
347:
735:
644:
600:
568:
776:
705:
688:
56:
310:
202:
178:
466:
461:
104:
325:
730:
639:
534:
276:
247:
138:
30:
656:
634:
624:
801:
786:
595:
573:
367:
756:
397:
158:
357:
838:
816:
407:
524:
412:
372:
298:
629:
821:
668:
551:
352:
320:
264:
35:
22:
315:
720:
673:
456:
293:
52:
40:
791:
417:
402:
382:
683:
434:
288:
490:
811:
867:
387:
745:
715:
578:
563:
512:
451:
422:
833:
502:
439:
335:
48:
17:
770:
750:
740:
710:
612:
392:
879:
39:
is the branch that deals with whether and how efficiently problems can be solved on a
892:
806:
796:
725:
259:
206:
125:
108:
142:
182:
84:
330:
162:
230:
862:
850:
678:
44:
693:
590:
781:
68:
This category has the following 8 subcategories, out of 8 total.
246:
The following 92 pages are in this category, out of 92 total.
47:. The field is divided into three major branches:
530:International Conference on Reachability Problems
8:
378:List of computability and complexity topics
540:Introduction to the Theory of Computation
243:Pages in category "Theory of computation"
248:This list may not reflect recent changes
7:
479:First Draft of a Report on the EDVAC
348:Chain rule for Kolmogorov complexity
508:History of the Church–Turing thesis
252:
223:
199:
135:
118:
101:
70:
62:
14:
736:Size-change termination principle
227:Theorems in theory of computation
645:Primitive recursive set function
601:Numbering (computability theory)
569:Mortality (computability theory)
706:Scale factor (computer science)
689:Recursively enumerable language
363:Church–Turing–Deutsch principle
122:Computational complexity theory
57:computational complexity theory
311:Blockhead (thought experiment)
81:Algorithmic information theory
1:
899:Subfields of computer science
467:Extended finite-state machine
462:Enumerator (computer science)
904:Theoretical computer science
731:Simply typed lambda calculus
640:Primitive recursive function
535:Intersection type discipline
277:List of undecidable problems
31:theoretical computer science
777:Tarski–Kuratowski algorithm
657:Quantum Byzantine agreement
635:Post correspondence problem
625:Parallel computation thesis
920:
817:Two Generals' Problem
802:Turing machine equivalents
787:Transcomputational problem
596:Nondeterministic algorithm
574:General recursive function
368:Circuit (computer science)
16:The main article for this
15:
757:SXM (computational model)
398:Computably enumerable set
839:Universality probability
408:Computation in the limit
326:Brooks–Iyengar algorithm
525:Interactive computation
413:Computational semiotics
373:Communicating X-Machine
353:Chaitin's constant
321:Bremermann's limit
299:Algorithmic game theory
630:Parallel terraced scan
822:Typed lambda calculus
669:Reachability analysis
552:Limits of computation
265:Theory of computation
203:Models of computation
179:Limits of computation
36:theory of computation
23:Theory of computation
721:Semiotic engineering
674:Reachability problem
457:Entscheidungsproblem
358:Church–Turing thesis
294:Admissible numbering
105:Computability theory
53:computability theory
41:model of computation
812:Turing's proof
792:Turing completeness
418:Cylindric numbering
403:Computation history
383:Computable function
139:Computer arithmetic
684:Recursive language
435:Description number
316:Andreas Brandstädt
289:Ackermann function
868:X-Machine Testing
388:Computable number
911:
773:
759:
746:Stream X-Machine
716:Semi-Thue system
579:Mutual recursion
564:Markov algorithm
513:Hypercomputation
452:Effective method
423:Cylindrification
232:
225:
208:
201:
184:
164:
159:Hypercomputation
144:
137:
127:
120:
110:
103:
86:
919:
918:
914:
913:
912:
910:
909:
908:
889:
888:
887:
886:
885:
884:
880:Yao's test
872:
855:
843:
834:Undefined value
826:
769:
762:
755:
698:
661:
649:
617:
605:
583:
556:
544:
517:
503:Halting problem
495:
491:Gödel numbering
483:
471:
444:
440:Digital physics
427:
340:
336:Byzantine fault
303:
281:
269:
240:
239:
238:
237:
234:
233:
222:
213:
210:
209:
198:
189:
186:
185:
169:
166:
165:
149:
146:
145:
134:
129:
128:
117:
112:
111:
100:
91:
88:
87:
61:
49:automata theory
27:
12:
11:
5:
917:
915:
907:
906:
901:
891:
890:
883:
882:
876:
873:
871:
870:
865:
859:
856:
854:
853:
847:
844:
842:
841:
836:
830:
827:
825:
824:
819:
814:
809:
804:
799:
794:
789:
784:
779:
774:
771:Tail recursion
766:
763:
761:
760:
753:
751:Sudan function
748:
743:
741:Ludwig Staiger
738:
733:
728:
723:
718:
713:
711:Self-reference
708:
702:
699:
697:
696:
691:
686:
681:
676:
671:
665:
662:
660:
659:
653:
650:
648:
647:
642:
637:
632:
627:
621:
618:
616:
615:
613:Omega language
609:
606:
604:
603:
598:
593:
587:
584:
582:
581:
576:
571:
566:
560:
557:
555:
554:
548:
545:
543:
542:
537:
532:
527:
521:
518:
516:
515:
510:
505:
499:
496:
494:
493:
487:
484:
482:
481:
475:
472:
470:
469:
464:
459:
454:
448:
445:
443:
442:
437:
431:
428:
426:
425:
420:
415:
410:
405:
400:
395:
393:Computable set
390:
385:
380:
375:
370:
365:
360:
355:
350:
344:
341:
339:
338:
333:
328:
323:
318:
313:
307:
304:
302:
301:
296:
291:
285:
282:
280:
279:
273:
270:
268:
267:
262:
256:
254:
253:
244:
241:
236:
235:
221:
220:
217:
214:
212:
211:
197:
196:
193:
190:
188:
187:
177:
176:
173:
170:
168:
167:
157:
156:
153:
150:
148:
147:
133:
132:
130:
116:
115:
113:
99:
98:
95:
92:
90:
89:
79:
78:
75:
72:
71:
66:
63:
13:
10:
9:
6:
4:
3:
2:
916:
905:
902:
900:
897:
896:
894:
881:
878:
877:
874:
869:
866:
864:
861:
860:
857:
852:
849:
848:
845:
840:
837:
835:
832:
831:
828:
823:
820:
818:
815:
813:
810:
808:
807:Turing tarpit
805:
803:
800:
798:
797:Turing degree
795:
793:
790:
788:
785:
783:
780:
778:
775:
772:
768:
767:
764:
758:
754:
752:
749:
747:
744:
742:
739:
737:
734:
732:
729:
727:
726:Shadow square
724:
722:
719:
717:
714:
712:
709:
707:
704:
703:
700:
695:
692:
690:
687:
685:
682:
680:
677:
675:
672:
670:
667:
666:
663:
658:
655:
654:
651:
646:
643:
641:
638:
636:
633:
631:
628:
626:
623:
622:
619:
614:
611:
610:
607:
602:
599:
597:
594:
592:
589:
588:
585:
580:
577:
575:
572:
570:
567:
565:
562:
561:
558:
553:
550:
549:
546:
541:
538:
536:
533:
531:
528:
526:
523:
522:
519:
514:
511:
509:
506:
504:
501:
500:
497:
492:
489:
488:
485:
480:
477:
476:
473:
468:
465:
463:
460:
458:
455:
453:
450:
449:
446:
441:
438:
436:
433:
432:
429:
424:
421:
419:
416:
414:
411:
409:
406:
404:
401:
399:
396:
394:
391:
389:
386:
384:
381:
379:
376:
374:
371:
369:
366:
364:
361:
359:
356:
354:
351:
349:
346:
345:
342:
337:
334:
332:
329:
327:
324:
322:
319:
317:
314:
312:
309:
308:
305:
300:
297:
295:
292:
290:
287:
286:
283:
278:
275:
274:
271:
266:
263:
261:
260:Computability
258:
257:
255:
251:
249:
242:
228:
224:
219:
218:
215:
207:(19 C, 125 P)
204:
200:
195:
194:
191:
180:
175:
174:
171:
160:
155:
154:
151:
140:
136:
131:
126:(14 C, 114 P)
123:
119:
114:
109:(10 C, 102 P)
106:
102:
97:
96:
93:
82:
77:
76:
73:
69:
65:Subcategories
64:
60:
58:
54:
50:
46:
42:
38:
37:
32:
25:
24:
19:
245:
143:(5 C, 136 P)
67:
34:
28:
21:
331:Busy beaver
43:, using an
893:Categories
231:(1 C, 5 P)
863:X-machine
851:Wang tile
679:Recursion
45:algorithm
694:Rounding
591:Nomogram
18:category
183:(12 P)
85:(22 P)
33:, the
782:Ten15
163:(6 P)
55:and
29:In
20:is
895::
250:.
229:‎
205:‎
181:‎
161:‎
141:‎
124:‎
107:‎
83:‎
59:.
51:,
875:Y
858:X
846:W
829:U
765:T
701:S
664:R
652:Q
620:P
608:O
586:N
559:M
547:L
520:I
498:H
486:G
474:F
447:E
430:D
343:C
306:B
284:A
272:*
216:T
192:M
172:L
152:H
94:C
74:A
26:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.