Jump to content

Simple set

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by MathMartin (talk | contribs) at 10:57, 14 August 2005 (Initial stub). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In computability theory a simple set is an example of a set which is recursively enumerable but not recursive.

Stub icon

This computer science article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Simple_set&oldid=20986544"