Assertion: machine | /r/CapableOf | unmark square
Facets:
Source sentences:
text: In his short 1936 note Post considers machines that either mark or unmark a square which means we have only two symbols \(S_0\) and \(S_1\) but he did not prove that this formulation captures exactly the Turing computable functions.