THEOREM OF THE DAY The DPRM Theorem Every recursively enumerable set is Diophantine. A set is recursively enumerable if there exists some (possibly non-terminating) algorithm which lists precisely the members of the set.

First Page		Document Content
Date: 2014-02-07 05:06:57		THEOREM OF THE DAY The DPRM Theorem Every recursively enumerable set is Diophantine. A set is recursively enumerable if there exists some (possibly non-terminating) algorithm which lists precisely the members of the set. Add to Reading List Source URL: www.theoremoftheday.org Download Document from Source Website File Size: 170,58 KB Share Document on Facebook