For programming languages, we have the concept of Turing completeness which expresses the fact that all computers and all languages are equal in their ability to represent any algorithm so long as we ignore the capacity of the storage medium. Is there a similar word for data encodings/representations?

For example, any number can be represented in unary, binary, ternary form. So long as all the data structures have the same “data capacity” between any given 2 structures A and B there exist functions:

`to :: A → B from :: B → A `

Where `from ∘ to == id`

.

This is obviously true for any (context insensitive) data structure that exists in a computer because they are literally all just strings of bits. But what is the word for this?