praptak

1440 ms·

3601.
by praptak 17y ago
"The probability that a fair election would produce [these number distribution disparities] is less than .005." Careful with that reasoning. Suppose there are four candidates, and the last digits of their total vote counts are 8,7,2,8. Fewe
3602.
by praptak 17y ago
"The last bead in each BeadSort row can contain a sticker with some metadata." Wrong. The beads in columns remain in the original order (not sorted) and so would these stickers.
3603.
by praptak 17y ago
Just make sure that you publish the proof for P=NP last, otherwise others could beat you to it :)
3604.
by praptak 17y ago
This would probably produce a program that cheats a lot. Perhaps not by simply hardcoding the answers to the tests, but by finding a good compressing function for the set of (input, output) pairs in the test. I bet this would seldom provide
3605.
by praptak 17y ago
"Sure, I had to precompute the answer and put it in lock boxes, but since he only gets to see one lockbox per run I don't have to make the lockboxes internally consistent, do I?" Yes you do. The lockboxes must be filled before Victor makes
3606.
by praptak 18y ago
This might be true for a theoretical perfect strongly typed language (SML comes close), but whatever C and C++ might gain by static typing, they lose by things like casts to (void *) and of course their unsafe pointers. Even Java isn't very
3607.
by praptak 18y ago
Where I live (not Sweden), the Judges' Code of Ethics forbids any personal contacts or economic associations that could cast any doubt on judge's impartiality while carrying out their duties. I'd say that membership in a lobbying organisati
3608.
by praptak 18y ago
Or if you substitute "True" for "False" in the "Authorized=" part of the link.
3609.
by praptak 18y ago
My suggestion for anyone wanting to make Lisp popular: make a Lisp analogue of Mark Pilgrim's "Dive Into Python". Or at least consider whether it is possible to write such a book for Lisp in its current state.
3610.
by praptak 18y ago
"However, please do not send us information that you consider to be confidential or proprietary." Well, what do you expect? Heed this advice from Google and you should be fine. It would be stupid for them to bend the other way - people woul
3611.
by praptak 18y ago
Manage your expectations :) There are questions that are challenging by nature (objectively hard problems) and those that are challenging to me, mostly because of my lack of experience in a particular domain, but are no-brainers for an expe
3612.
by praptak 18y ago
Basically, yes - branches are chosen with probabilities proportional to their weights, but you can achieve that with just one random float. Just pick a random x from [0, sum of weights in the tree], then find a node n, such that sum of weig
3613.
by praptak 18y ago
"What physical features make space work?" is a very interesting question indeed. It is at the core of research by Christopher Alexander, especially "A Pattern Language" - the book that inspired the pattern movement in software design.