RE

Hierarchy: 
Description: 
{{computing theory}} 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.
Ngram: 
Ngram Text: 
RE
Source: 
Wiktionary
Issue: 
0
Wiktionary tag: 
Ngram Count: 
1
Wikokit WikiText ID: 
140966