zodiac

42 ms·

451.
by zodiac 10y ago
The algorithm that computes Ackerman's function recursively ( https://en.m.wikipedia.org/wiki/Ackermann_function ) always terminates in finite time
452.
by zodiac 10y ago
Not the OP, but from skimming the ToC, about 90% of the topics covered are taught in undegrad courses required for graduation for my CS degree. > Because my friends who do "real CS" at various universities generally avoid anyth
453.
by zodiac 10y ago
> I think the best way to learn about computer science it to program for a machine so simple anyone can understand how every bit works. No magic. We do this in my school, sort of. The 2nd year courses teach you to know how to write assem
454.
by zodiac 10y ago
> An algorithm that takes infinite time Can you give an example of such an algorithm? My understanding of an algorithm is that it must terminate in a finite amount of time, but maybe you have a different definition of an algorithm
455.
by zodiac 10y ago
It has been changing slowly and slightly though, I often hear electric guitars in contemporary "orchestral" pieces (film scores like by Hans Zimmer, musical theatre like POTO)
456.
by zodiac 10y ago
Uber disagrees with the DMV's interpretation of the language of the relevant regulation
457.
by zodiac 10y ago
hmm, I've never heard that definition of a rigged game - do you have a source? (Eg Webster defines rigging as, to manipulate or control usually by deceptive or dishonest means)
458.
by zodiac 10y ago
I would say that the choice of what bets to place is definitely part of the game
459.
by zodiac 10y ago
> does modern technology suck just for me To try to counter potential selection bias I'll give my boring answer: I would be really pissed if those things kept happening to me, so you're not particularly intolerant, but they don
460.
by zodiac 10y ago
Hmm, I think it's more accurate to say that the debt is the integral of the deficit. It's not like Congress passes laws to set the debt, then we examine how much the debt changed year to year and call that the deficit. Instead the
461.
by zodiac 10y ago
Yes, my point is that even though numpy provides a "black box" set of functions, using them is so unnatural (at least for me) that I was forced to completely understand what the numpy functions were doing internally to have any ho
462.
by zodiac 10y ago
> finding out they were working with numpy makes it even more so (since numpy takes the pain out of the matrix operations) hmm, I did the cs231n homework and had the opposite experience. It was really easy to complete it by ignoring nump
463.
by zodiac 10y ago
> You don't really need to be a mathematician to do it I know - I'm marvelling at the patience and effort required
464.
by zodiac 10y ago
I remember there was a mathematician (I forgot who) who solved it without outside help (like you) and without the use of computers - absolutely crazy
465.
by zodiac 10y ago
I'm not sure why so many people here are ignoring Levandowski's stated reason for not applying for the permit / downvoting people who agree with him, without explaining why they think Levandowski's argument is incorrect.
466.
by zodiac 10y ago
I agree...I think a real "proof by construction that the language is [Turing] complete" would just be an interpreter for Turing machine programs written in Lisp, which is pretty boring.
467.
by zodiac 10y ago
I think it's a bit of humor
468.
by zodiac 10y ago
> There is a huge amount of research to create an "algebra" of synthetic biology do you have links to such research?
469.
by zodiac 10y ago
Yeah
470.
by zodiac 10y ago
It's a general fact that any series satisfying the list of conditions in http://calculus.subwiki.org/wiki/Alternating_series_theorem is bounded by any two consecutive partial sums; the author probably expects ever
471.
by zodiac 10y ago
> Also, the program is called KILL so one could be forgiven for assuming it's main purpose is to KILL things... I think this is the source of the problem. kill really is just for sending signals. In the "Unix philosophy" t
472.
by zodiac 10y ago
To me the 40 drops suggests that the operator only "guessed" how many drops are enough, to the nearest multiple of 10, and left that as good enough; and rhe 38 suggestion was basically saying, "find out exactly how much is en
473.
by zodiac 10y ago
Don't you think the in-browser latex editor (with no backend server required) would be useful for at least some people?
474.
by zodiac 10y ago
But most judges are making subjective decisions and not just "running code". The US constitution is law; can you compile it into code such that a computer could tell you whether a particular piece of legislation was unconstitution
475.
by zodiac 10y ago
> Can't they still bill whatever they want? I think contracts (between law firms and their clients) use hours worked because they don't know upfront how complicated cases will be, how long it will take etc. It's not just f
476.
by zodiac 10y ago
What is the alternative though? Through the article Joel gave reasons as to why those two limits can't be placed (even if the company was nice and wanted to)
477.
by zodiac 10y ago
Don't you have to have node_modules in PATH to be able to run `babel ...`?
478.
by zodiac 10y ago
To be fair that assumes you have node and npm set up properly, including making them upgradable, making sure node_modules is in PATH, etc. I think it's easy to forget "obvious" knowledge like this that (for me at least) had t
479.
by zodiac 10y ago
Yes, Congress can impeach and try the President ( https://en.wikipedia.org/wiki/Impeachment_in_the_United_Stat... , https://en.wikipedia.org/wiki/Article_One_of_the_United_Stat... )
480.
by zodiac 10y ago
I watched Stumpf testify in front of the Senate Banking Committee, and while I agree that (from what I saw) he should be held accountable, what I don't understand is why the right venue for it is the Senate instead of the Judiciary. Wa

More ›