Assertion: turing machine | /r/CapableOf | compute the function
Facets:
Source sentences:
text: The second concerns the definition of Turing computable, namely that a function will be Turing computable if there exists a set of instructions that will result in a Turing machine computing the function regardless of the amount of time it takes.