psykotic

52 ms·

391.
by psykotic 15y ago
> Yes! Charles Moore has been essentially living this since the 1970's. No many have his level of courage though. I'm an unbounded admirer of Charles Moore. But courageous? He's a software solipsist. His approach is certainly bold but I
392.
by psykotic 15y ago
Just yesterday I happened to watch the first episode of BBC's Wild China. The section on caves goes into this, and among other things shows a small village school built inside a giant cave. Here's a picture: http://static.bbc.co.uk/program
393.
by psykotic 15y ago
That's a matter of perspective. Folds and scans exist for all regular data types, not only arrays, so I consider this a part of functional programming and type theory. Here he is computing the history of states of a random walk as scan (*)
394.
by psykotic 15y ago
> Not directly related to Pearl's work, but he basically deserves credit for the wider renaissance in Bayesian techniques. Post hoc ergo propter hoc? The success of naive Bayes classifiers for spam filtering must have improved popular p
395.
by psykotic 15y ago
> With version control software like git, ..., accreditation doesn't matter much. Mr Markov, I presume?
396.
by psykotic 15y ago
> A game that came out in 1988 and only ever sold 100k units (plus lord knows how many pirated copies). In those days 100,000 units sold meant a big hit. The original sales numbers for Secret of Monkey Island were in that neighborhood.
397.
by psykotic 15y ago
What you say goes against common sense and experience. Pausing randomly in the middle of a train of thought is not on the same level as a carefully considered pause. There was a real-life case study of the difference on the Language Log whe
398.
by psykotic 15y ago
That is a false equivalence--a rhetorical pause differs from a random pause. Random pauses are certainly preferable to any overt verbal tics.
399.
by psykotic 15y ago
Feynman was an undergraduate at MIT and his graduate studies were at Princeton. He never held a position at MIT.
400.
by psykotic 15y ago
You're confusing yak shaving with bikeshedding.
401.
by psykotic 15y ago
Correction: He wasn't a game programmer.
402.
by psykotic 15y ago
> In this case where changes come in at two times (which are subject to all the raciness of the real world that exists regardless), one will win. That describes many methods of optimistic concurrency control, but it doesn't answer my qu
403.
by psykotic 15y ago
> I'd like to know how its model of transaction isolation works given that reads and writes are claimed to be independent. Any MVCC-style model allows full concurrency between readers and writers. The bigger problem is managing concurre
404.
by psykotic 15y ago
> In fact, bit shifting is always faster than anything. This is overly simplistic. A fixed bitwise mapping is simple wiring and about as fast as anything can be, yes. Extending that, the "fastest" 32-bit shifter might be to put down 31
405.
by psykotic 15y ago
If so, that's a much weaker and not terribly interesting claim. The concrete example of counting with Catalan numbers is more compelling; it would be very challenging for children who lack experience with recursive definitions and inductive
406.
by psykotic 15y ago
> Some of the problems in this book are HARD, but they are generally well posed problems of actual research interest to mathematicians Could you share a few examples? I've looked through the books from Gelfand's correspondence course (w
407.
by psykotic 15y ago
For insight into the computing side of Bell Labs, Doug McIlroy's retirement lecture is a great read: http://research.swtch.com/bell-labs . A paper covering the earlier period is A History of Computing Research at Bell Laboratories (1937-19
408.
by psykotic 15y ago
Ah, I had clicked through to the original article which does not contain those caveats. Yes, I meant question 14, not 12.
409.
by psykotic 15y ago
Puzzles 9 and 12 assume sizeof(int) is 2. It's poor form for a language lawyering quiz to make an assumption about implementation-dependent behavior. It's especially poor form when the assumption made is long outdated and likely to surprise
410.
by psykotic 15y ago
If they are looking to fill a fixed spot, sure. But more often than not, that isn't how hiring works.
411.
by psykotic 15y ago
Of course. Why wouldn't they be willing to wait? It's that or nothing.
412.
by psykotic 15y ago
Make yourself look so valuable that they wouldn't dream of rejecting you for some invented reason. If front-line resume screeners are the issue, get an existing employee to submit your resume and vouch for you and get buy-in from their boss
413.
by psykotic 15y ago
I took a year off to travel before my current job. Best thing I ever did. Before leaving, I made sure I had several standing job offers. Get your foot in the door when you're in a stronger position. Do it for your own peace of mind if nothi
414.
by psykotic 15y ago
Well, you're never going to deeply understand everything in a subject in only one or even several passes over the material, but there's no reason you can't concurrently treat analysis both formally and informally, with lots of concrete exam
415.
by psykotic 15y ago
That must be a US thing. It seems strange to first do a course without proofs and then later redo it with proofs. My point was that where I studied, the courses for mathematicians were all "proof courses"; there were separate courses for en
416.
by psykotic 15y ago
> Many people feel a blend of slight obscurity with succinctness are the core ingredients for an elegant solution. My exemplar for mathematical elegance is page 3 of Serre's A Course in Arithmetic. In a tidy page of text, it proves what
417.
by psykotic 15y ago
None of his issues (except the purely cosmetic complaints) apply to Turbo Pascal, which has been the de-facto standard dialect of Pascal for nearly 3 decades.
418.
by psykotic 15y ago
> Super Meat Boy has the "ungodly hard" thing down SMB is very playable and does a lot to mitigate its difficulty. You can find much harder platformers out there. An example is IWBTG ( http://kayin.pyoko.org/iwbtg/ ) whose creator also
419.
by psykotic 15y ago
The version of MiniSat (a Chaff-style solver) that won the SAT competition a few years ago is only on the order of five hundred lines of code. Code: http://minisat.se/MiniSat.html Paper: http://minisat.se/downloads/MiniSat.pdf
420.
by psykotic 15y ago
> I still believe that their requirement of overtime is due to poor management, pressure by execs, poor specs, and inflated goals. It's only a requirement because game developers have tended to put up with it. Especially in the earlier

More ›