RE

RE
Abbreviation of "recursively enumerable"; the class of decision problems for which a yes answer can be verified by a Turing machine in a finite amount of time.
See Also: R, coRE

Wikipedia foundation.

Игры ⚽ Поможем написать курсовую

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”