Assertion: turing machine | /r/CapableOf | accept enumerable language
Facets:
value: recursively
type: MANNER
Source sentences:
text: A universal Turing machine can calculate any recursive function, decide any recursive language, and accept any recursively enumerable language.