But then Jeff Lin (that's it: from now on, all Jeffs get last names here) started talking to me about them too and he pointed me at a bunch of resources. And now I see trochee, my favorite local computational linguist, linking to an SVM library, too! I printed out a few papers last week and I've been reading through them slowly. I get the idea, and I get some of the math, but the in-depth paper started going into stuff like Lagrange multipliers and I forget how those work. One of the articles I read said that writing an SVM library yourself is a bad idea because of potential numeric precision pitfalls and recommended using an existing library, but what's the fun in that? I will grab some of my math textbooks next time I'm at my mother's and try again.
English class had me read The Diamond Age again, and the bits about Turing make me wish I'd taken more CS classes on theory. But again, I have the book, so I can just read it. And with computer history/theory on my mind:
An Unsolvable Problem of Elementary Number Theory, or something like that, by Alonzo Church(!). It's neat to read a paper filled with lambdas that was written back in the 30s: their syntax is a little weird (a tip, if you try to read it: S with subscripts and superscripts means substitution) and it's cute how he defines things in paragraphs of text using words like "inductively" where today we'd just use EBNF or (that form you always see in papers about type systems that I don't know the name of). My eyes started glazing at their definition of recursive functions, but the paper overall is about some application of Gödel numbering to programs. (Which is especially neat 'cause he mentions, in footnotes, insights gained from conversations with Gödel himself.)
I feel like a lacking computer-scientist-linguist with such holes in my knowledge: theory, history, statistics, algorithms. So much to learn! I've spent the past five years here and it's still not nearly enough.