To clarify a point, I don''t feel that younger people are less mature/likely to be professional than older people, I was merely stating that there was no excuse for lack of respect for others (and stating that has led to comments of "but I''m just 13" before). To be honest I''ve met 13 year olds that were far more mature and pleasant than some 40 year olds I know.
I''m also glad to see that this conversation has apparently veered off the flamewar path now *smile*
Brian... your demo sounds awesome. Would you mind either making a demo/tutorial for GameDev of it or posting it somewhere we can link to? If you don''t have posting space I have 20M of domain I could post it for you on.
-fel
MP3-Beating Compression
~ The opinions stated by this individual are the opinions of this individual and not the opinions of her company, any organization she might be part of, her parrot, or anyone else. ~
I think Fel missed the joke.
Both of those are impossible.
At least, I know decrypting one time pads is, so I'll assume the sorting one is, too. (Since I'd assume you'd have at least O(n) operations, but then again, it's been too long since I've studied sorting. If this was really an issue, I'd do a bit more research, of course.)
Y'know, as an aside...This is the same problem a lot of us had with the original post. Sure it sounds "awesome", but some things just cannot be done.
Deathy
Edited by - deathlok on 4/18/00 3:06:58 PM
Both of those are impossible.
At least, I know decrypting one time pads is, so I'll assume the sorting one is, too. (Since I'd assume you'd have at least O(n) operations, but then again, it's been too long since I've studied sorting. If this was really an issue, I'd do a bit more research, of course.)
Y'know, as an aside...This is the same problem a lot of us had with the original post. Sure it sounds "awesome", but some things just cannot be done.
Deathy
Edited by - deathlok on 4/18/00 3:06:58 PM
There is no such thing as IMPOSSIBLE!!!!!!!!!!!!!
Everything is POSSIBLE. You just have to know how to go about it. People have inevented math, how do you know what they are telling you is not BS? There''s no math people... realize that.. it''s all in people''s imagination... so stop critisizing whenever you get a chance... if you wanna help, do so, otherwise sit back and listen to what kieren, and everyone else has to say...
I''m sick of people complaining that something is impossible... if you dont know how to make it work, that''s YOUR OWN PROBLEM, that someone else''s...
Everything is POSSIBLE. You just have to know how to go about it. People have inevented math, how do you know what they are telling you is not BS? There''s no math people... realize that.. it''s all in people''s imagination... so stop critisizing whenever you get a chance... if you wanna help, do so, otherwise sit back and listen to what kieren, and everyone else has to say...
I''m sick of people complaining that something is impossible... if you dont know how to make it work, that''s YOUR OWN PROBLEM, that someone else''s...
And who the hell taught you the word "IMPOSSIBLE?" If you didn''t know it exists, how would you explain yourself? IMPOSSIBLE=i haven''t figured it out YET!!
i''m out....
*signing off*
i''m out....
*signing off*
Let me try to explain this so everyone can understand it. You cannot have an algorithm that can compress any file. It''s really easy to prove by the well ording princepal, there is no infinite decreasing sequence in the positive integers.
So, now for the proof by contradiction: Assume we have an algorithm that can compress any file. We could continually compress a file over and over again, but we would get down to negative length, so this is a contradiction.
There have, in the past, been mathematically ''proven'' things that have been proved false later. However, the basic compression proofs rely on fundamental mathematical elements, and to disprove it would shake the very foundations of mathematical sciences.
Now, what really pisses me off is that kieren posted these ''results'' and didn''t even have a working program. Now the fact is that kiejen probably does have a program that compresses files. From what he posted so far, however, I doubt it would work well on anything but text files, and is by no means cutting edge or an improvement on anything we have already.
It is obvious now that kieren did not compress a 5mb mp3 into 16kb as he first suggested. He has changed his BS stroy through many posts, each making his ''algorithm'' less and less good (surprise, surprise).
As for the camps, there are only two. Those who believe in things based on faith, and those that need proof. I am surprised by how many of the first there are.
Mike
So, now for the proof by contradiction: Assume we have an algorithm that can compress any file. We could continually compress a file over and over again, but we would get down to negative length, so this is a contradiction.
There have, in the past, been mathematically ''proven'' things that have been proved false later. However, the basic compression proofs rely on fundamental mathematical elements, and to disprove it would shake the very foundations of mathematical sciences.
Now, what really pisses me off is that kieren posted these ''results'' and didn''t even have a working program. Now the fact is that kiejen probably does have a program that compresses files. From what he posted so far, however, I doubt it would work well on anything but text files, and is by no means cutting edge or an improvement on anything we have already.
It is obvious now that kieren did not compress a 5mb mp3 into 16kb as he first suggested. He has changed his BS stroy through many posts, each making his ''algorithm'' less and less good (surprise, surprise).
As for the camps, there are only two. Those who believe in things based on faith, and those that need proof. I am surprised by how many of the first there are.
Mike
"Unintentional death of one civilian by the US is a tragedy; intentional slaughter of a million by Saddam - a statistic." - Unknown
I don''t think it''s possible to sort unbounded data faster than O(n log n). A good heap sort implementation will achieve the latter on average. Radix sort can get O(n), but that''s not unbounded (right?). I think it''s been proven that one can''t sort unbounded data faster than O(n log n).
(in any case it sure is nice to be talking about something constructive)
-James
(in any case it sure is nice to be talking about something constructive)
-James
I''m fluent in C++ and Java, know something of Perl, HTML, DirectDraw.CSE student at the University of California San Diego.
If I''m right in saying that it''s been proven that one can''t sort data that fast, then I''m saying that it is.....IMPOSSIBLE! Yes, impossible. Sorry...
-J
-J
I''m fluent in C++ and Java, know something of Perl, HTML, DirectDraw.CSE student at the University of California San Diego.
Gladiator said:
> There is no such thing as IMPOSSIBLE!!!!!!!!!!!!!
So that means it must be possible that you are wrong about that. ;-)
Man1: "There are no absolutes!"
Man2: "Absolutely none?"
Man1: "umm....."
Logic - it will getcha every time. ;-)
aig
aig
What''s so wrong with the word impossible anyway, Gladiator? There are some things that are impossible. For instance, me getting laid tonight is impossible. I''ve accepted it; it IS impossible (in so far that it is NOT POSSIBLE). See?
-J
-J
I''m fluent in C++ and Java, know something of Perl, HTML, DirectDraw.CSE student at the University of California San Diego.
Could someone tell me what one time pads are?? I''ve never heard of them before.
jritts, osmanb is just making fun I think.
Visit our homepage: www.rarebyte.de.st
GA
jritts, osmanb is just making fun I think.
Visit our homepage: www.rarebyte.de.st
GA
Visit our homepage: www.rarebyte.de.stGA
This topic is closed to new replies.
Advertisement
Popular Topics
Advertisement
Recommended Tutorials
Advertisement