You have some information which is X bits long, so you turn it into a game of life board. Then you find a parent state which is still X bits long. How does that help with compression?
I could tell you how run length encoding works, but that's about it.
More than anything, it's a fantasy compression scheme.
I was originally inspired by rainbow tables (https://en.wikipedia.org/wiki/Rainbow_table) . The idea would be some sort of compression where there would be a table of uncompressed data blobs that map to some sort of hash key. The compressed file would be a sequence of the key.
If you're reading this and you have a working knowledge of data compression, I imagine this is throwing off all sorts of red flags in your head. Feel free to explain why it wouldn't work.
I wonder if you would be able to hide messages in superficially normal pictures like that.
Pi being an irrational number contains all other numbers. Therefor rather than sending someone a file (eg a video) all you need to do is search the never-ending π and send people the offset instead. 100% compression here we go.
https://github.com/philipl/pifs/
In reality though, searching through Pi to find that offset - especially for bigger files, can take a while.
Given first 500 digits: 3.1415926535897932384626433832795028841971 6939937510582097494459230781640628620899 8628034825342117067982148086513282306647 0938446095505822317253594081284811174502 8410270193852110555964462294895493038196 4428810975665933446128475648233786783165 2712019091456485669234603486104543266482 1339360726024914127372458700660631558817 4881520920962829254091715364367892590360 0113305305488204665213841469519415116094 3305727036575959195309218611738193261179 3105118548074462379962749567351885752724 89122793818301194912
Let's encode: 10,72,7
//index, length
48,2|139,2|13,1
Even with a fixed length we run into the same issue.
If you ignore either half of the information problem, you can get what looks like compression but really isn't.
See https://www.patrickcraig.co.uk/other/compression.php for a fun story about "data hiding" to show exactly how sneaky the data hiding can be.
Very interesting story as well, thank you.
Given the looooooooong history of people on the internet not believing that, I preemptively invite you to implement it. If you could make it work there's big money to be made.
More constructively and with less effort, while https://cs.stackexchange.com/questions/42464/are-there-any-c... on the surface doesn't seem to address your scene, if you think about it for long enough, you'll find it does.
My reasoning amounted to "there are infinite repetitions of any sequence in Pi, therefore for any given sequence there must exist one occurrence with a compressible index."
Which, after consideration, I acknowledge is incorrect :)
In this case your starting automata is acting as a program you want to find the smallest one that produces your object as output. It is in general undecidable to know if you found the smallest possible program that produces a given output.
So probably the answer is technically yes, but probably not in the way you are thinking of.
Would it be possible to have some sort of cellular automata program that generates the uncompressed data after so many generations.
The compressed data would be the start state of the game field, which over several generations would produce the uncompressed data.
For it to work, you would have to start with the uncompressed data and work backwards. Which is what the author of this article is trying to do with these pictures.
Based on what I can understand from the article, there is no hope for my data compression scheme.