Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
icarot
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
6 ms
·
1.
▲
by
icarot
10y ago
I am particularly happy that people outside of that SF/NY/Boston bubble chose Donald Trump, while acknowledging his character flaws, instead of paying any attention whatsoever to the mass media. Though I fully agree with you -- We
2.
▲
by
icarot
12y ago
Sincerely thought this was an article on [articulatory] phonetics.
3.
▲
by
icarot
12y ago
C'mon, this unimpressive feature is the default in Arch for a while now. Attempting to talk about "Linux", as if some single operating system - lack of pluralism between commenters to handle the differences notwithstanding -
4.
▲
by
icarot
12y ago
The last sentence was the most important; the rest should be ignored. Have patience, perseverance, and you'll do anything. Or, converge onto interesting problems and fail gloriously; the only way to do anything of worth. The post compa
5.
▲
by
icarot
12y ago
Yeah. Most languages don't. Python and Javascript compilers still don't and Emacs LISP still doesn't.
6.
▲
by
icarot
12y ago
Thanks so much for that paper. That'll save me time thinking about transforming functions on my own. Are you sure they make that optimization? How do you know? (I'm not familiar with either code base). Are you absolutely sure that
7.
▲
by
icarot
12y ago
Definitely agree on the "oversold". I notice you said "half the problem" at the end of your third paragraph there. I'm assuming the other half is that it seems foolish to save the return address for a recurse. Only
8.
▲
by
icarot
12y ago
That's why I said 'deficient' compilers. Yes, it is well-known. Just reuse the stack frames on the next call; dead simple.
9.
▲
by
icarot
12y ago
You're right. The de-facto way to prove an algorithm as stack-free is run it on a register machine, having no stack to begin with. As you suggest, it'd also be optimal to use a problem which calls for deep recursion. Hence the tas
10.
▲
by
icarot
12y ago
I'm so confused by this. His solutions end up using recursion, yet he says it's stack-free. Which doesn't make any sense at all considering deficient compilers allocate stack frames on each call for languages like C. This is
11.
▲
by
icarot
12y ago
Simply structure your theses, that is, lead your reader down the tree outline of your thoughts. When those thoughts are worthwhile and clearly expressed, you yield a result not unlike tokenadult's. Now, he has actually iterated upon th