Assertion: turing machine | /r/HasProperty | speaking
Facets:
value: roughly
type: DEGREE
Source sentences:
text: The universal Turing machine which was constructed to prove the uncomputability of certain problems, is, roughly speaking, a Turing machine that is able to compute what any other Turing machine computes.