Talk:Computation problem
Appearance
Notes
Provide various equivalent notions of computability ranging from Turing computability to Abacus computability to general recursive computability.
Outline computability of total, partial, and uncomputable function, giving examples for each.
Parse and conjoin function problem with and revert to, what I take to be the more correct, computation problem - viz., this article (unless someone objects?).