This is an incredible achievement. The most impressive piece of GoL engineering I've ever seen!
Clearly, number of gliders is no longer a good measure of complexity of constructions. Perhaps one should fix a straightforward way to encode a set of gliders by position (e.g. using [1]) and orientation and take the minimum number of bits of such a description.
Just one question:
> 1274729 – build a DBCA and pass control to it
> 192584 – build a new constructor that reads stored data instead of live data
> The final 200093 bits get stored in the Binary Storage and Retrieval device, these same 200093 bits are counted below:
How come this adds up to 1667406, which is 1615 more than the claimed total of 1665791 bits?
Ooh, I appreciate the diligence! The numbers here came from manually fiddling with more granular output from Pavgran's special purpose "profiler" script. One of those steps, where the DBCA assumes control of the bit stream, takes 1615 gliders. I would bet I made a mistake and added it twice, probably to both the DBCA building and the task of the DBCA itself. It belongs in only one of them!
Clearly, number of gliders is no longer a good measure of complexity of constructions. Perhaps one should fix a straightforward way to encode a set of gliders by position (e.g. using [1]) and orientation and take the minimum number of bits of such a description.
Just one question:
> 1274729 – build a DBCA and pass control to it
> 192584 – build a new constructor that reads stored data instead of live data
> The final 200093 bits get stored in the Binary Storage and Retrieval device, these same 200093 bits are counted below:
How come this adds up to 1667406, which is 1615 more than the claimed total of 1665791 bits?
[1] https://en.wikipedia.org/wiki/Levenshtein_coding