fadmmatt

8 ms·

31.
by fadmmatt 17y ago
Just curious where you got the number $500,000 I've heard ballpark estimates that the total wealth of the U.S., the sum of all assets (bridges, buildings, companies, cars) minus debts is roughly $80-$90 trillion. Wikipedia seems to think i
32.
by fadmmatt 17y ago
No studies? http://www.dvorak-keyboards.com/Dvorak_vs_qwerty_keyboard_te... Remember: A study need not be published in a journal and well-typeset to be scientific.
33.
by fadmmatt 17y ago
In my experience, yes. I switched to Dvorak a couple years ago, and I've been glad I did. I used to have terrible pain in my wrists and forearms. For eliminating pain, switching to Dvorak was as effective as switching to an expensive ergo
34.
by fadmmatt 17y ago
For implementing languages, I highly recommend Scheme, Haskell and Scala. These languages are hell-on-wheels for tearing apart and transforming syntax trees. I teach a compilers class, and I encourage my students to use a mixture of Scala a
35.
by fadmmatt 17y ago
SICP and HtDP are good for starting out. I often use Scheme when I teach compilers, and I've got a few Scheme-related blog posts designed for the curious student: * Church encodings: http://matt.might.net/articles/church-encodings-demo-in-
36.
by fadmmatt 17y ago
Here's a short implementation (with explanation) in Scheme: http://matt.might.net/articles/implementation-of-regular-exp...
37.
by fadmmatt 17y ago
Hold the amusement--the third project for the class is (of course) a Scheme -> CPS -> C compiler: http://matt.might.net/teaching/fall-2009-advanced-compilatio... Naturally, students are required to implement call/cc. And, in my st
38.
by fadmmatt 17y ago
Don't forget that Java already has anonymous classes, which can be used to mimic closures. I taught my advanced compilers class how to compile Scheme directly to Java by using them to implement lambda: http://matt.might.net/articles/compil
39.
by fadmmatt 17y ago
I think the coolest way to write a lexer is to use the derivative of regular expressions: http://matt.might.net/articles/implementation-of-regular-exp... It's surprisingly easy to implement, as the prior example demonstrates in Scheme. Th
40.
by fadmmatt 17y ago
Don't forget the Y combinator and the memoizing Y combinator: http://matt.might.net/articles/implementation-of-recursive-f...
41.
by fadmmatt 17y ago
The lambda calculus is Turing-complete, so the following language is sufficient to encode any computable function: exp ::= var | (lambda (var) exp) | (exp exp) Check out http://matt.might.net/articles/church-encodings-demo-in-sche... T
42.
by fadmmatt 17y ago
Thanks for pointing that out. I don't remember why I did it that way. I changed them to more sensible variable names.
43.
by fadmmatt 17y ago
I've now served on peer-review committees for selective venues in my field, so I can say that the authors' background and training are not considered when making the decision to accept or reject. (Double blind venues won't even know who yo
44.
by fadmmatt 18y ago
I got my Ph.D. in CS from Georgia Tech (I think it's #9 according to the joke that is US News), and I'm a prof at the University of Utah. Here are my three points of advice: 1. PUBLISH! 2. PUBLISH!! 3. PUBLISH!!! When I'm reviewing applica
45.
by fadmmatt 18y ago
Done: http://www.yaplet.com/
46.
by fadmmatt 19y ago
Battlestar Galactica.
47.
by fadmmatt 19y ago
I hope that's SHA1 plus a secret salt. Otherwise, I can just build a reverse map of SHA1'd ips. for ip = 0 to 2^32: unhash[SHA1(ip)] = ip.
48.
by fadmmatt 19y ago
I just finished my PhD in CS at Georgia Tech, so I'll share my two cents on the topic. (My field was programming languages and compilers.) I wouldn't characterize graphics as the "soundest" field. I might give that title to formal methods