Assertion: algorithm | /r/HasProperty | computed by model
Facets:
value: per the church
type: OTHER
Source sentences:
text: Structured programming, canonical structures: Per the Church–Turing thesis, any algorithm can be computed by a model known to be Turing complete, and per Minsky's demonstrations, Turing completeness requires only four instruction types—conditional GOTO, unconditional GOTO, assignment, HALT.