Questions about Turing computability and recursion theory, including the halting problem and other unsolvable problems. Questions about the resources required to solving particular problems should be tagged (computational-complexity).
There is no tag wiki for this tag … yet!
Tag wikis help introduce newcomers to the tag. They contain an overview of the topic defined by the tag, along with guidelines on its usage.
All registered users may propose new tag wikis.
(Note that if you have less than 20000 reputation, your tag wiki will be peer reviewed before it is published.)