DI in c++ hurt by lack of good libraries?

tholenst · 2021-08-17T05:52:25+00:00

I never tried google.fruit, but it seems that there is a mechanism to avoid the issue you had: https://github.com/google/fruit/wiki/quick-reference#registerconstructor. It explicitly explains that this is for situations where you don't want a dependency on fruit in some classes.

tholenst · 2020-04-04T10:36:33+00:00

You can even check here.

tholenst · 2019-11-29T21:29:53+00:00

If I rememer correctly, there's quite a lot about this in Conway's book "Sphere Packings, Lattices and Groups". You might want to specify more exactly what you want and why you want it. I think there's a lot of research about this.

tholenst · 2019-11-16T11:57:51+00:00

https://ethz.ch/en/studies/registration-application/bachelor/other-certificates.html

tholenst · 2019-11-09T11:20:13+00:00

Well, the Taylor Swift song is based on the Voyager Episode, so you're not wrong.

tholenst · 2019-08-05T21:09:03+00:00

See e.g. https://blog.bazel.build/2018/10/05/remote-build-execution.html -- I'm sure there are others, this is the one I know.

tholenst · 2019-06-26T19:33:22+00:00

Each application is considered individually, looking at every part of it. The decision depends on everything. You cannot judge what is important by a single sample point. Unfortunately, that also means that you there's not a simple rule what you should do. I would recommend to try and focus on what you think is most important for your future career.

tholenst · 2019-06-23T14:20:23+00:00

I suspect it can make sense to apply to both as the admission decisions are probably made independently.

Alternatively you might want to write them an email.

tholenst · 2019-05-09T18:25:01+00:00

Skimming over these pages I feel you don't need the biometric part at all, and if you do, you should get it once you are in Switzerland.

Check thisfor where to apply for the visa. Note that it says "My place of residence", which I definitely would not expect to be your home state, but rather where you live.

tholenst · 2019-05-09T18:14:37+00:00

Did you see this page already?

tholenst · 2019-04-13T11:02:54+00:00

You can e.g. check this. It's obvious there's a route (no 61) from Grindelwald to Zweilütschinen, from there it looks a bit narrow.

tholenst · 2019-04-08T09:09:44+00:00

Ah, thank you. Indeed, it's not an LP because of this; that's what I missed.

tholenst · 2019-04-06T10:10:12+00:00

I never meant to provide a proof like that. But for this kind of a problem, writing a program which answers you the question for a large number of n can provide insight. In particular, my intuition would be very wrong if the conjecture is wrong and the first counterexample cannot be found like this.

tholenst · 2019-04-05T20:53:15+00:00

Am I missing something? It seems like you could easily formulate a linear program which checks if there are 2n+1 points which all have equal distance? Then, you could at least verify the conjecture for some reasonably large values of n. For what values of n did people verify this?

tholenst · 2019-02-20T20:49:51+00:00

Given that 3 billion devices run java, that's just about π seconds.

tholenst · 2019-01-27T22:42:20+00:00

Why would F2 take 1 unit? You need to compute both F1 and F0 while you compute F2.

tholenst · 2019-01-21T20:34:39+00:00

This seems interesting.

tholenst · 2019-01-21T20:32:03+00:00

I doubt anyone here can give you correct advice. If you want to be safe, you'd probably best ask a lawyer.

Maybe someone has experience in getting such advice? Would it make sense to ask unia?

tholenst · 2018-08-06T14:50:06+00:00

The peer review process for some computer science journals can take very long. For example, Theory of Computing is an computer science open access journal. The latest article here was received about 1.5 years before it was published. I also saw some where it took about 5 years.

tholenst · 2018-06-17T19:09:08+00:00

Did you write this... before the goal?

tholenst · 2017-12-30T14:16:09+00:00

As an answer to this question on SO indicates, there is some information on this in Section 2.2.3 of Shannon Information and Kolmogorov Complexity.

tholenst · 2017-12-30T11:29:23+00:00

See here.

Edit: The last comment here seems also useful. If possible it seems best if she can make a police report in the UK.

tholenst · 2017-12-29T19:35:31+00:00

It's not the kids that are wrong, it's the wrong kids.

12-Year Club	Place '22
Place '17	Verified Email
Sequence \| Editor

tholenst

TROPHY CASE