SSH != crypto algorithm.

I got bored this afternoon and did the proof a few different ways. Unfortunately, the details won't fit in this comment box.

they are surprisingly inexpensive ($500 plus some labor w/ analog video downlink). they are also likely to have been repaired quite frequently (that is if you're lucky and didn't leave a pile of kindle your last encounter with gravity).

on an unrelated note, it's fun to watch confirmation bias in the wild.

you missed my point.

yes, the market will ultimately dictate the value of a skill set; however, any organization that sends the message that experience and a demonstrated track record when it comes to building and improving core products is at least 23% less valuable than the flavor of the week, something is broken. alternately, you can see their decision as a wager that risking the morale of their organization so that some kid fresh out of college who claims to know X would, somehow, pay off. neither seems particularly wise to me.

i would walk. there is something clearly fundamentally broken with that particular organization and its leadership.

a couple thoughts:

1) approximate randomized algorithms are your friend, especially when we talk about things like (RAN|MAP|MLE|M)SAC in model fitting. for some classes of problems, random approximate algorithms are the *only* attack that we have that are feasible in terms of time/space complexity.

2) your analysis fails to account for the hidden leading constant (otherwise there's no reason to consider quicksort when you have heapsort) and what happens when N gets to be large enough. the fact is that for big enough N or big enough S, the lower order algorithms will start to become dramatically faster, even if repeated applications are necessary to cross-validate results.

3) unless you're using arbitrary precision math, all of these algorithms are approximate anyway and great care must be taken to understand how these systems can be (pre)conditioned to minimize the compounded effects of fixed precision arightmetic.

touche.

how so?

let me summarize: the same math that drives google's search (spectral graph theory) has been shown to be really useful in solving a very common class of linear equations if you're willing to roll the dice (randomize algorithm).

not really.

the method applies to the _general_ (i.e. dense) case of diagonally dominant (i.e. |A_i,i| > |A_i,j| for all i,j) symmetric systems that show up all the time (grammian matrices, for example), not just the sparse case.

give me $30k in consulting fees and i'll tell you who to hire.

i was going to ask the same question. i've worked on projects where the idl generates about 100k sloc just by itself. add in all the other custom code generation and up that by another 200k lines.