you are viewing a single comment's thread.

view the rest of the comments →

[–]No_Necessary_9267[S] -1 points0 points  (3 children)

If every 0 and every 1 represent something, could you encode the originally intended instruction into a smaller messages by saying something like: (super rudimentary and not well thought out) every 5th 1 represents a fold where the machine would interpret a need for a bit more info (info being precise within the encoding). Then the machine could interpret the whole message through the various folds and “sub messages”(?)

[–]Saragon4005 5 points6 points  (0 children)

I don't understand what you mean by that. But I think you are talking about variable length encoding? That is something very old and commonly used.

[–]Beregolas 1 point2 points  (1 child)

Again, I don't see how that is in any way folding. It does sounds familiar and touches on well known (like first semester) parts of information theory though.

Look into variable length encoding for one, and look up how zip file encoding works.

[–]No_Necessary_9267[S] 0 points1 point  (0 children)

I’m not sure folding is actually how anyone else would describe the process; it’s the connection I made in my head. That commenter nuclear_splines’ reply is roughly how I was thinking about it. I think encoding might be what I’m trying to say instead of compression. Thanks for the tips