belovedeagle

40 ms·

361.
by belovedeagle 13y ago
As a student in my first /real/ real analysis course (called "Advanced Calculus I" by the registrar, predictably), I have a slight quibble with your characterization of high school "calculus" as real analysis.
362.
by belovedeagle 13y ago
Tell me: where did you get your free car?
363.
by belovedeagle 13y ago
And with CDABLE_VARS set, you can simply do: dir_name In fact, you don't even have to use the directory hash for this, you just do, e.g.: MY_DIR=/path/to/dir; MY_DIR Frankly, this is far superior to the linked method.
364.
by belovedeagle 13y ago
I really don't see what the big deal is with tar. Everyone seems to hate it. Probably because exactly one of those flags is necessary: zcat merc.tgz | tar -x
365.
by belovedeagle 13y ago
The trick with typedef is it is exactly the same syntax, in all cases, as declaring a variable of that type. This is essentially the only way you're going to ever remember how to do function pointer typedefs: typedef int (function_t)(i
366.
by belovedeagle 13y ago
While aliases may be great for saving time typing, you can use them to steal from yourself the opportunity to learn how unix commands like 'tar' work. Frankly, tar should never seem like an "incantation", because most of
367.
by belovedeagle 13y ago
The thing is, if you feel like the type system is "getting in your way" you have to step back and ask, "do I really understand what I'm achieving here?" Of course, it's very easy to feel like you know what you
368.
by belovedeagle 13y ago
Or don't lie and explain to what degree of certainty it is an infinite loop...
369.
by belovedeagle 13y ago
No, the algorithm is to run the program and see if any state is repeated; if it is, the program is in an infinite loop (where "state" means, roughly, all memory and remaining length of input). Of course, this requires 2^[bits of state] bits
370.
by belovedeagle 13y ago
In fact, come to think of it, for any program which 1) uses a bounded amount of memory and 2) has a bounded input (taking "input" as broadly as possible), the halting problem is always decidable in 2^[bits of state] "steps". There are a l
371.
by belovedeagle 13y ago
Frankly, I think this shows that the "jokers" don't know what they're talking about either. Yes, the problem is undecidable in general , but one could certainly develop an interesting program that solves the problem sometimes, and can defi
372.
by belovedeagle 13y ago
Better yet, git log --since='last tuesday'. Try it.