Hulver's site || Technology trolls and lowbrow culture, from trenchmouths.

Diaries
Everything
Who's Online?
FAQ / Help

in all day training

By gzt (Thu Mar 01, 2012 at 12:15:32 PM EST) gzt, recursion, chess, visits, test, tex, latex (all tags)

for our new tool for doing AAP. there will be a bit of hassle in getting things set up for the transition, i don't think we explicitly considered the time investment it would take the team to transition the data management blah blah blah. by "we" i mean management, by "the team" i mean "gzt".

well, i wasn't in most of those meetings and presumed, based on the ones i was in and what the vendor was saying that there would be minor changes to the process. oh well, whatevs. and the people in on the meetings don't know about the process and aren't technical people. and their end, which isn't "getting the data into the system", is indeed going to be easier with the new tool.

i'm taking six days off toward the end of the month. going to PA and VA. ND got back to me and invited me to a thing that would make it 8 days off and fit in perfectly - it's right on the way, it's right on the end of my other trip. but, on the other hand, it would mean being gone for that much longer. instead of a 10-day trip, it's a 12-day trip. that's 20% longer. it's a long time for us to be away from home. so i'll think about it. i should strongly consider it, since it's the only one that's gotten back to me and has told me about my funding.

ANOVA class has a test next week. numerical analysis has a take-home which doesn't look so bad at all. i'll fully TeX it up nicely. i like harvey mudd's template, so i've been using that whenever i've been doing something more than just writing an answer out.

i've been eating beans and other relatively indigestible food lately. i think i need some bean-o until i'm used to eating this volume of beans. just for the sake of my coworkers.

recursion is nice.

i won't have time for chess for a while.

< There's a gun in your hand and it's pointing at your head | Ask Husi: I admit I am annoying and boring how can I not be? >

Login

Related Links

Hit Counter

56 Husi users have viewed this.

Comment Controls

in all day training | 9 comments (9 topical, 0 hidden)

heard back from VCU by gzt (4.00 / 2) #1 Thu Mar 01, 2012 at 04:30:41 PM EST

they offer little money, but they're in a cheap town that's bigger than the one vtech is in and it's about the same money vtech would offer. the guy who wants to work with me does exactly the sort of stuff i'm interested in. however, it's an obscure school with a small department. i'm offering to visit between PSU and VT.

raw vegetables seem to do that to me by garlic (4.00 / 1) #2 Thu Mar 01, 2012 at 07:13:35 PM EST

more than beans. I had lovely beans and rice for dinner and lunch to no ill effect. But eat a raw salad and things aren't working the way I like.

: it probably is the vegetable matter. by gzt (2.00 / 0) #3 Thu Mar 01, 2012 at 09:59:32 PM EST

raw vegetable matter.
bean-o should help with that, too.
but the beans do it, too. some more than others.

[ Parent ]

Recursion is evil by ucblockhead (2.00 / 0) #4 Thu Mar 01, 2012 at 10:23:35 PM EST

Iterative versions usually perform better.

We used to ask people in interviews to write a recursive version of Fibonacci, and then if they did (sadly, "if"), we'd then ask to rewrite it iteratively and then ask why it was better to do so.
---
[ucblockhead is] useless and subhuman

why it's better to do so: by gzt (2.00 / 0) #5 Thu Mar 01, 2012 at 11:07:09 PM EST

well, for one, it's a lot easier to get it right. also you won't overflow the call stack. i'm curious as to how somebody could fail fibonacci, since it's 4 lines of pseudo-code.

but i was just thinking, in my diary, about turing completeness and computability - recursion makes things nice.

[ Parent ]

You'd be suprised by ucblockhead (2.00 / 0) #7 Fri Mar 02, 2012 at 10:09:59 AM EST

I once sat in an interview where someone with a CS degree and five years experience first had to have Fibonacci explained to them and even then were unable to write the algorithm in "the language of their choice".
---
[ucblockhead is] useless and subhuman

[ Parent ]

: i wouldn't mind needing it explained by gzt (2.00 / 0) #9 Fri Mar 02, 2012 at 10:49:27 AM EST

but failing to write is lame.

[ Parent ]

fibonacci by nathan (2.00 / 0) #8 Fri Mar 02, 2012 at 10:32:20 AM EST

i = 1 ; j = 1 ; int k ; print i ; print j ;
do { k = i + j ; print k ; i = j ; j = k ; } while k < cap ;

I took one computer science class in 1996, mostly memorable for teaching me Delphi. While teaching the GMAT, I got to see engineers and CS majors and whatnot fail all kinds of things that were easier than fibonacci, including prime factorization, 10 choose 3, and correct use of the past perfect.

[ Parent ]

recursion is superior. by the mariner (4.00 / 0) #6 Fri Mar 02, 2012 at 09:31:13 AM EST

you just write in languages that don't do tail call elimination in simple cases where iteration is equivalent. hell, even gcc seems to do it in some circumstances.

[ Parent ]

in all day training | 9 comments (9 topical, 0 hidden)