The problem with sorting is a bit more complex - my language (polish) uses mostly ascii with some additionall characteres. The additionall characters shoud be sorted IN the sequence of the ascii characters - so sorting just by unicode does not work for this. And I believe this is quite common case.
The application was just meant to store names in some european languages - ideally with originall spelling.
I've found it really disinformative when thay claimed unicode support in 7.2 but for most scripts there is no proper collation. That was not so easy to find out since the unicode support was generally really hart to set up and I was assuming I must had made some mistake. Is it better in 7.3? I can't find anywhere any list of scripts supported.
Does the parser really needs to understand the encoding? I mean all the syntax important characters are from the ascii range - so they have the same encoding in all of them. The difference in encoding is importand to semantics but not to syntax.
I'm a bit suprised about the complexity of XML - isn't it all about balanced parenthesis expressions? Don't read me wrong - I believe you that it has those 89 productions. I just state that it's suprising and perhaps the fact that it looks so simple is the reason that managers like it so mutch.
A first thought: you can view Slash as a very confined kind
of Wiki.
Let's concentrate on viewing the page with
some treshold > 0. Then generally anybody can
add something at the end of the page, and those
with moderation points can delete things from
the page.
I just believe there is something more general
hiding behind them.
By the way: I feel how awkward this comment is -
I would like to let it be modified the wiki style
by someone who would better grasp the idea that
I just feel is there somewhere.
They claim to have the newest versions
(something like a day after freshmeat).
I wander if simply compiling on the user machine
does so much simplify putting together packages
to make a distribution.
I hope it's just the beginning of some research
that would lead to goals that you mention.
It might seem obvious but in science you need
some statistical data to make it accepted.
Isn't it a troll? I mean the punished behaviour
did hurt the group - the group did not gain
when it could so you can just move the zero point
and say that it lost.
Somebody has already posted some example.
x + y = 4
x + 0y = 4
2x + y = 8
0x + y = 0
You can take any two of these equations to be able
to extract the solution x = 4, y = 0.
Sorry - I'd replied to your previous post
before I read this one.
The right mathematical theory seems to be
the Chaitin Omega Number theory. There are
uncompressable strings, but it can be impossible
to say if given string is incompressable, I mean
you can say if it is compressable, but some time
you can't prove if it is not.
The random data send by the challenger does not
seem to be a good move - there is much chance
you can find patterns in random data (just like
long substrings of 0 - what is the probabillity
to find them - I don't know but it's a growing
function of the size, ok asume the guy deleted
all such substrings - so how about consecutive
01 - you cant prevent all patterns in a random
string).
Conclusion: the challange seems to be quite
fair for both sides.
If that was true you could take the Universal
Turing Machine and run your progran on it.
For every data it would produce a program and
data set - the program and data can be considered
together the compressed data. This way the
your program would be the universal compressor.
This is impossible.
I can be impossible to algorithmically find
the uncompressable data anyway, and random data
is not enough for that as well.
The Chaitin Omega number theory seems applicable
at this problem.
Slashdot Mirror
The problem with sorting is a bit more complex - my language (polish) uses mostly ascii with some additionall characteres. The additionall characters shoud be sorted IN the sequence of the ascii characters - so sorting just by unicode does not work for this. And I believe this is quite common case.
The application was just meant to store names in some european languages - ideally with originall spelling.
As far as I remember it well I had to run the initdb with unicode locale set in the environement. And that was not that obvious task.
And my question - how about sorting?
I've found it really disinformative when thay claimed unicode support in 7.2 but for most scripts there is no proper collation. That was not so easy to find out since the unicode support was generally really hart to set up and I was assuming I must had made some mistake.
Is it better in 7.3? I can't find anywhere any list of scripts supported.
Does the parser really needs to understand the encoding? I mean all the syntax important characters are from the ascii range - so they have the same encoding in all of them. The difference in encoding is importand to semantics but not to syntax.
I'm a bit suprised about the complexity of XML - isn't it all about balanced parenthesis expressions?
Don't read me wrong - I believe you that it has those 89 productions. I just state that it's suprising and perhaps the fact that it looks so simple is the reason that managers like it so mutch.
Then you could use standard gcc on all platforms.
It is the New Kind of Math - why bother about the old one?
There might be 6 billion embeded processors but
it does not mean 60 times more programes for
them than for PC. So the market is actually
not that big.
Why everybody here seems to be so opposed
to diversification in fees based on used
resources?
The bandwidth is not a unlimited resource.
A first thought: you can view Slash as a very confined kind
of Wiki.
Let's concentrate on viewing the page with
some treshold > 0. Then generally anybody can
add something at the end of the page, and those
with moderation points can delete things from
the page.
I just believe there is something more general
hiding behind them.
By the way: I feel how awkward this comment is -
I would like to let it be modified the wiki style
by someone who would better grasp the idea that
I just feel is there somewhere.
They claim to have the newest versions
(something like a day after freshmeat).
I wander if simply compiling on the user machine
does so much simplify putting together packages
to make a distribution.
I hope it's just the beginning of some research
that would lead to goals that you mention.
It might seem obvious but in science you need
some statistical data to make it accepted.
Isn't it a troll? I mean the punished behaviour
did hurt the group - the group did not gain
when it could so you can just move the zero point
and say that it lost.
Somebody has already posted some example.
x + y = 4
x + 0y = 4
2x + y = 8
0x + y = 0
You can take any two of these equations to be able
to extract the solution x = 4, y = 0.
The exclusion of the most robust Open Source database product makes the article complete crap.
I agree. Perhaps the GPL is a bit obsolete. Hey the world is changing the GPL predates internet and it should be amended.
Sorry - I'd replied to your previous post before I read this one. The right mathematical theory seems to be the Chaitin Omega Number theory. There are uncompressable strings, but it can be impossible to say if given string is incompressable, I mean you can say if it is compressable, but some time you can't prove if it is not. The random data send by the challenger does not seem to be a good move - there is much chance you can find patterns in random data (just like long substrings of 0 - what is the probabillity to find them - I don't know but it's a growing function of the size, ok asume the guy deleted all such substrings - so how about consecutive 01 - you cant prevent all patterns in a random string). Conclusion: the challange seems to be quite fair for both sides.
If that was true you could take the Universal Turing Machine and run your progran on it. For every data it would produce a program and data set - the program and data can be considered together the compressed data. This way the your program would be the universal compressor. This is impossible. I can be impossible to algorithmically find the uncompressable data anyway, and random data is not enough for that as well. The Chaitin Omega number theory seems applicable at this problem.