# Halting problem/Related Articles

From Citizendium, the Citizens' Compendium

*See also changes related to Halting problem, or pages that link to Halting problem or to this page or whose text contains "Halting problem".*

## Parent topics

## Subtopics

## Bot-suggested topics

Auto-populated based on Special:WhatLinksHere/Halting problem. Needs checking by a human.

- Alan Turing [r]: British mathematician, code breaker and computer pioneer.
^{[e]} - Cantor's diagonal argument [r]: Proof due to Georg Cantor showing that there are uncountably many sets of natural numbers.
^{[e]} - Graph coloring [r]: Graph labelling, which assigns labels traditionally called 'colours' to elements of a graph subject to certain constraints.
^{[e]} - History of computing [r]: How electronic computers were first invented; how the technology underlying them evolved.
^{[e]} - Kurt Gödel [r]: (1906-1978) Austrian born American mathematician, most famous for proving that in any logical system rich enough to describe naturals, there are always statements that are true but impossible to prove within the system.
^{[e]} - Lambda calculus [r]: A formal system designed to investigate functions and recursion.
^{[e]} - Optimization (computer science) [r]: Transformation of computer programs and compilers to decrease runtime.
^{[e]} - Register allocation by graph coloring [r]:
*Add brief definition or description* - Register allocation [r]:
*Add brief definition or description*