Assertion: turing machine | /r/HasAspect | infinite number of encodings
Facets:
value: by padding the encoding
type: MANNER
Source sentences:
text: Additionally, we convene that every invalid encoding maps to a trivial Turing machine that immediately halts, and that every Turing machine can have an infinite number of encodings by padding the encoding with an arbitrary number of (say) 1's at the end, just like comments work in a programming language.