Slashdot Mirror

← Back to Users

User: temporary_pass

temporary_pass's activity in the archive.

Stories
0
Comments
4
First seen
Last seen
Profile
(view on slashdot.org)

Comments · 4

  1. Re:Not random data on ZeoSync Makes Claim of Compression Breakthrough · · Score: 1

    They're not different sizes, they are simply made up of different logical constructs.

    Given any finite N-bit string, a construct C can be defined such that 1 = |{C}| = N!

    Therefore given an initial string of size N and a second (compressed) string of size M, if M! = N then a bijection is possible

  2. Re:Not random data on ZeoSync Makes Claim of Compression Breakthrough · · Score: 1

    They're not different sizes, they are simply made up of different logical constructs. Given any finite N-bit string, a construct C can be defined such that 1 <= |{C}| <= N! Therefore given an initial string of size N and a second (compressed) string of size M, if M! = N then a bijection is possible

  3. Re:Not random data on ZeoSync Makes Claim of Compression Breakthrough · · Score: 1



    They're not different sizes, they are simply made up of different logical constructs.

    Given any finite N-bit string, a construct C can be defined such that 1 |{C}| N!

    Therefore given an initial string of size N and a second (compressed) string of size M, if M! = N then a bijection is possible

  4. Re:Not random data on ZeoSync Makes Claim of Compression Breakthrough · · Score: 1
    By your 'trivial' argument, compression of random data is impossible on any scale (you can't have a bijection between sets of different sizes).


    They're not different sizes, the are simply made up of different logical constructs.

    Given any finite N-bit string, a construct C can be defined such that 1

    Therefore given an initial string of size N and a second (compressed) string of size M, if M! = N then a bijection is possible.