Jump to content

Talk:Computation problem

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Nortexoid (talk | contribs) at 04:58, 23 November 2004 (signature edit). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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?).Nortexoid 04:58, 23 Nov 2004 (UTC)

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Computation_problem&oldid=7772799"