4 ms·
Not really. The specialness of TFA's constructions is that the interpreter does not need to have any knowledge of the large numbers a priori.
by dumbo-octopus 3y ago
Not really. The specialness of TFA's constructions is that the interpreter does not need to have any knowledge of the large numbers a priori.
- 8note 3y agoAlternative contructions don't have to either - eg. "The bit 1 represents running the algorithm from TFA"
- dumbo-octopus 3y agoThat's precisely identical to declaring the number in the interpreter.
- deleted 3y ago[deleted]