You may run into problems trying to advertise an Area 51 proposal on an SE site. Last time I tried I was told it was not acceptable due to it leading to spamming of every proposal across lots of sites
Yesterday google turned up "codegolf.xyz". It seems to be an up-to-date mirror of codegolf.se but not exactly. For instance, if I go to the first question and click "more comments", it doesn't show me more comments. Is this a legitimate mirror or is it something else?
@wizzwizz4 I wasn't complaining, just pointing out that your reasonable sounding low level of advertising is already more than the tiny amount I was told was not acceptable :)
@wizzwizz4 I don't know if community ads might be an exception since they only appear if the community welcomes them, but I wanted to let you know before you put too much effort into it...
I understand that posting comments to existing SE sites advertising an Area 51 proposal is not allowed.
However, I'm not sure if the same applies to Community Ads. Since these are only shown on the main site if the community supports them on meta, is it acceptable to post a suggested advert for ...
@wizzwizz4 We have meta posts about making ads to be shown on other sites, but as far as I can see we don't yet have a meta post where we can vote on which ads will be shown on our site
The nearest I can find is
> You will soon be able to select your own community ads
@MartinBüttner Do you know if we can go ahead with a meta post to get voting started while we wait for our community ads to be activated? Or does the meta post need to be an official one?
@orlp @trichoplax I think I managed to fix up the mathematical formulation of my actual problem... it's a bit... trickier... in reality I've got h = p f^-1 g^n(x) f q, where q embeds the input of h in a higher-dimensional space (could be q(x) = (x, 0, 0) for instance), f is an arbitrary bijective function on that space, g is as before, but can be repeated a number of times which can depend on h's input, and p is a projection from the higher dimensional space back onto Z.
(this is still not 100% my actual setup but I think it contains all the relevant features)
and I also think I can show that thanks to the projection and the repeated application of g something as simple as g(x, ...) = (x+1, ...) is sufficient after all.
thanks for trying to help, but the underlying issues are pretty tricky and doing my head in right now, and I don't feel like divulging the entire background at the moment ;) ... I just wanted to update orlp and trichoplax because under the conditions I presented yesterday we were left with the conclusion that what I was looking for was impossible
@MartinBüttner Could you estimate the runtime-complexity of this?
public int mySqrt(int x) {
if(x<1) return 0;
if(x<4) return 1;
if(x<9) return 2;
int hi = ((x-1)>>1)+1;
int lo = (hi+(x/hi))>>1;
while(lo<hi){
hi = lo;
lo = (lo+(x/lo))>>1;
}
return hi;
}
String compression
A compressed string looks like “...», where the dots are a chunk of base-250-encoded data. The decompression algorithm is a bit complicated: the chunk is interpreted as a “mixed-base” integer, with divmod breaking off various parts of this integer and constructing a string out...
@Downgoat You have admin access to zyabinVI/cable-box thanks to your membership in the Artistic Content team and read access to all other repos thanks to default conditions. If you contribute enough to repos, you may get write access to them.
Everyone who wants to participate in zyabinVI: the number has increased by one.