Math Is Fun Forum

LQ

Real Member

Registered: 2006-12-04

Posts: 1,285

Attempt of zipping files etc.

Codesize & vincinity of 1 & vincinity of 0 has one code solution I postulate
Whereas vincinity of 1 is the middle of the ones and
Vincinity of 0 well you get the idea. DO I need SAY MORE?
Secondly, to find the vincinities, you need a homogen magnetic field with the same fieldlines as the ones alternatively the zeroes, and run electrons along it to be filtered in a shiffer, and the electron that runs straight is the "vincinity", which also pierce the shiffer straight through.
Hence you have saved perhaps many million years of calculations.
Thereafter, it is a piece of cake to figure out where the ones and zeroes are, I figure, given the speed of the electron. You could just aswell register it!

Last edited by LQ (2008-05-29 22:12:39)

---

I see clearly now, the universe have the black dots, Thus I am on my way of inventing this remedy...

Ricky

Moderator

Registered: 2005-12-04

Posts: 3,791

Re: Attempt of zipping files etc.

What is codesize?  The number of symbols in a language?  Or perhaps the size of what you're attempting to zip?

What are vicinity of 0 and 1?

---

"In the real world, this would be a problem.  But in mathematics, we can just define a place where this problem doesn't exist.  So we'll go ahead and do that now..."

LQ

Real Member

Registered: 2006-12-04

Posts: 1,285

Re: Attempt of zipping files etc.

What is codesize?  The number of symbols in a language?  Or perhaps the size of what you're attempting to zip?

What are vicinity of 0 and 1?

1. Machine Code digits; their number! (OK?)
2. The position which is nearest all the ones or zeroes, so that (distance = d) 1/d(1,1) + 1/d(1,2) + 1/d(1,3)... +1/d(1,n) = 0, and left and right of the position is positive versus negative, hence distance d, can be negative or positive, depending on what side of the position.

---

I see clearly now, the universe have the black dots, Thus I am on my way of inventing this remedy...

Ricky

Moderator

Registered: 2005-12-04

Posts: 3,791

Re: Attempt of zipping files etc.

The position which is nearest all the ones or zeroes

So a mean value of all the positions of the 0's or 1's?

so that (distance = d) 1/d(1,1) + 1/d(1,2) + 1/d(1,3)... +1/d(1,n) = 0, and left and right of the position is positive versus negative, hence distance d, can be negative or positive, depending on what side of the position.

How could 1/d(1,1) ... 1/d(1,n) = 0?  First off, d(1,1) = 0, so I assume you just included that term by accident.  But 1/d(1, 2) ... 1/d(1, n) are all positive, since 1 < 2...n.

---

"In the real world, this would be a problem.  But in mathematics, we can just define a place where this problem doesn't exist.  So we'll go ahead and do that now..."

LQ

Real Member

Registered: 2006-12-04

Posts: 1,285

Re: Attempt of zipping files etc.

The position which is nearest all the ones or zeroes

So a mean value of all the positions of the 0's or 1's?

so that (distance = d) 1/d(1,1) + 1/d(1,2) + 1/d(1,3)... +1/d(1,n) = 0, and left and right of the position is positive versus negative, hence distance d, can be negative or positive, depending on what side of the position.

How could 1/d(1,1) ... 1/d(1,n) = 0?  First off, d(1,1) = 0, so I assume you just included that term by accident.  But 1/d(1, 2) ... 1/d(1, n) are all positive, since 1 < 2...n.

No, Left to right; d is the distance, d(1,3) is the distance to the third digit in the code and allright, some function disjunction there POSSIBLY.

---

I see clearly now, the universe have the black dots, Thus I am on my way of inventing this remedy...

Ricky

Moderator

Registered: 2005-12-04

Posts: 3,791

Re: Attempt of zipping files etc.

So is d(3, 1) = -d(1, 3)?  And is d(1, 3) = 2?

and allright, some function disjunction there POSSIBLY.

What?

---

"In the real world, this would be a problem.  But in mathematics, we can just define a place where this problem doesn't exist.  So we'll go ahead and do that now..."

John E. Franklin

Member

Registered: 2005-08-29

Posts: 3,588

Re: Attempt of zipping files etc.

Convert the bytes into just a string of bits, thousands of bits.
Based on the size of the file to be zipped, choose a
number such as 13 or 19 or something, for the length of
bit-strings that you expect there to be some duplicates in
the thousands of bits; but also look for the non-existence
of strings that are a couple of bits shorter.  Perform an
exchange of the shorter strings into the place of the longer
strings, and put the shorter string at the beginning of the file
in such a way that it can be undone later.
Continue this process as long as time permits, also being
careful not to interject mistakes due to overlapping string
problems that cause confusion if this is a problem, I am
not sure...

---

igloo myrtilles fourmis

John E. Franklin

Member

Registered: 2005-08-29

Posts: 3,588

Re: Attempt of zipping files etc.

Also treat the file not as just one linear string.
On each pass, change the routine, so you
go through the bits in various orders that are
built into the decypter and encrypter.  Like
pretend the bits go with the even ones, and
then the odd ones, and more complex ways.
This should help keep things going for a while,
so the file doesn't become stagnant.

---

igloo myrtilles fourmis