Are you kidding me? My product owner and management ask me all the time to implement features "fast".
1,343 karma · joined October 15, 2019
Are you kidding me? My product owner and management ask me all the time to implement features "fast".
Oh please
What's wrong with DLL hooking though?
> I asked the professors if we could instead port MINIX3 to the Raspberry Pi
I think they were expecting you to fail.
> QEMU's Raspberry Pi emulation accuracy was so abysmal
When I did some hobby OS dev my strategy was to make it work on QEMU and then pray it would work on real hardware as well, which worked OK...
How did you handle the debugging the raspberry pi on real hardware?
That can't possibly be the hardest bug ever
Any real number x has an infinite continued fraction representation. By efficient I mean that the information of the continued fraction coefficients is an efficient way to compute rational upper and lower bounds that approximate x well (they are the best rational approximations to x).
> They are occasionally convenient for certain problem structures but, as I'm sure you've already discovered, somewhat less convenient for a wide range of common problems.
I'm curious what you mean exactly. I've found them to be very convenient for evaluating arithmetic expressions (involving both rational and irrational numbers) to fairly high accuracy. They are not the most efficient solution for this, but their simplicity and not having to do error analysis is far better than any other purely numerical system.
> fundamentally equivalent to simple fractions.
This feels like it is a bit too reductionist. I can come up with a lot of example, but it's quite hard to find the best rational approximations of a number with just fractions, while it's trivial with continued fractions. Likewise, a number like the golden ratio, e, or any algebraic number has a simple description in terms of continued fractions, while this is certainly not the case for normal fractions.
That continued fractions can be easily converted to normal fractions and vice versa, is a strength of continued fractions, not a weakness.
A good way to think about the framework, is that for any expression you can compute a rational lower and upper bound for the "true" real solution. With enough computation you can get them arbitrarily close, but when an intermediate result is not rational, you will never be able to compute the true solution (even if it happens to be rational; a good example is that for sqrt(2) * sqrt(2) you will only be able to get a solution of the form 2 ± ϵ for some arbitrarily small ϵ).
As a fun fact, I have a not-that-old math textbook (from a famous number theorist) that says that it is most likely that algorithms for adding/multiplying continued fractions do not exist. Then in 1972 Bill Gosper came along and proved that (in his own words) "Continued fractions are not only perfectly amenable to arithmetic, they are amenable to perfect arithmetic.", see https://perl.plover.com/yak/cftalk/INFO/gosper.txt.
I have been working on a Python library called reals (https://github.com/rubenvannieuwpoort/reals). The idea is that you should be able to use it as a drop-in replacement for the Decimal or Fraction type, and it should "just work" (it's very much a work-in-progress, though). It works by using the techniques described by Bill Gosper to manipulate continued fractions. I ran into the problems described on this page, and a lot more. Fun times.
It probably doesn't help that I've seen many courses/documents that are (in hindsight) derivatives from SICP, so I have the nagging thought "not this again" when a topic is introduced in SICP.
It's the trivial solution. It's significantly more efficient than using backprop. It's much simpler and leads to practically the same result.
This makes me wonder why you would use backprop to do this. It feels like a waste of time, and I'm not sure why this post generates so much attention on HN.
Also see https://nullprogram.com/blog/2020/11/24/
> I'm pretty sure that's no more efficient than guessing all pixels at once and trying to check of that worked or not.
It's iterative so you don't have to run for a very long time, and it will keep improving the loss function for longer.
It would probably work even better if you tweak the loss function with some kind of averaging/blurring filter.
But this doesn't always work and you still need to be good at adding/subtracting.
But it seems that Steve Ballmer used this question as if it has a single right answer, and that answer is "no". Unless it's more about the question "do you want to play this game, right here, right now?", then it becomes more about heuristics and quick reasoning.
It's all about context I guess.
I'd say it's impossible to answer this question conclusively within the time frame of an interview. That makes it, in my opinion, a bad interview question.
My answer to this question would be to show that I understand what it would take to answer this question correctly (you'd have to find a mixed strategy that has a positive expected value for every choice of number), I wouldn't be able to give a confident "yes" or "no" answer on the spot. I think that's the only correct answer.
In practice, I think this question is advantegeous for those who confidently blurt out an answer and then make up a heuristic argument for it. But a heuristic argument can be found for both "yes" and "no".
What you're saying sounds to me like "your answer doesn't need to be correct, it just needs to sound reasonable". What you're filtering on with this question is good bullshitters.
To me, the only reasonable to this question is "I don't know". I think even a mathematical genius like Terrence Tao would not be able to give you the answer to this on the spot. (Although I can also totally believe that he would instantly see this from some obscure theorem that only like 5 people on the planet know.)
To be honest, I think Steve just didn't grasp the mathematical deepness of the problem.
This is infuriating and the same for all the big companies (at least Google, Microsoft, Apple); you have a serious issue and simply no way to talk to a representative. The best you can do is post something on Hacker News and hope it somehow gets picked up.
I worked at a company that paid Microsoft a lot to have a 1-day SLA for support. When I contacted them, I got a reply back weeks later saying "hey sorry I missed your email". About two weeks later (which was the time it took to email back and forth), it was clear that I had to insert another ticket and mark the subject as something else (that was not directly related, but apparently the team responsible for that subject was also working on the functionality I found a bug in. There was no way for me to know this since it was something internal to Microsoft). So, I had to go through the whole procedure again.
Once I did that, the reply was "oh yeah, we dropped that functionality but the documentation doesn't mention it. we recommend you use <technology X> for this". Where, of course, technology X did not support the feature I was trying to use.
That was the main point? Man, the article goes on and on about definitions and semantic versioning and how we should call observability "olly", but glad to hear there's actually a coherent thought behind it.
Also, I don't think the "it's too expensive to log everything" argument should be true. Storage is insanely cheap and you can fit a whole lot of information inside a single MB (even more so when using compression).
However, every unread tab I close feels like a personal failure to keep up.
I can see the value of news articles and short videos like those from Fireship: It might be educational and/or entertaining, but if not, it hasn't been a serious time investment, so it doesn't matter anyway.
In some sense, yes. But I wouldn't say my mom uses Linux when she uses her Ipad to visit a website hosted on a Linux server.
Am I totally out of touch with reality or is this a completely ridiculous remark? Only 1 procent of people is able to afford the most basic food?