fizbin

18 ms·

1.
by fizbin 6y ago
As an aside, it's possible to modify Laurikari's algorithm slightly and obtain PCRE semantics w.r.t. capturing groups, and those correctly. (POSIX capturing semantics are designed for standards specs. I've never met an actual
2.
by fizbin 10y ago
Well, first off you make this (USE UNIQUE PASSWORDS) part of orientation, and maybe have part of orientation involve rolling dice and using the diceware list. Then, you reinforce that by using some sort of SSO setup/service (you can ou
3.
by fizbin 10y ago
We can certainly do without passwords for every stupid little website. Unless you're rightfully a central force in the user's life - say, their main bank - you really should have users log in through Google, or Facebook, or Twitte
4.
by fizbin 10y ago
Don't store passwords at all if you can avoid it. Then, bend over backwards to avoid it. Do all login through OAuth or the related proprietary "login with" mechanisms Facebook and Twitter have. Offer your users a choice of me
5.
by fizbin 10y ago
And worse, when you actually need to talk about someone screwing up and encrypting passwords (see http://www.xkcd.com/1286/ ), this mis-education of your readers will have to be carefully undone first.
6.
by fizbin 10y ago
https://en.wikipedia.org/wiki/One_instruction_set_computer
7.
by fizbin 10y ago
Goldman Sachs - they're way far ahead of any other large bank or financial services company.
8.
by fizbin 10y ago
Some more technical information is available on CrowdStrike's blog: http://www.crowdstrike.com/blog/bears-midst-intrusion-democr...
9.
by fizbin 11y ago
My experience with writing real production Haskell code is this: your first large Haskell project will be a failure, largely from missed deadlines and being unable to properly judge what is going to be easy and what hard. (Unless you delibe
10.
by fizbin 11y ago
And unlike the one on stackexchange, it's actually correct! (I have a regex -> DFA compiler here that I just threw your regex through. Seven states, connected as expected)
11.
by fizbin 11y ago
Note that the 12,701 character regex is WRONG . It doesn't even match "70". Even the binary regex is wrong. The original 32K regex pointed to in the stackexchange problem statement however is perfectly correct. Test code:
12.
by fizbin 11y ago
This - that it's extremely rare to even be able to think the right things to produce maintainable code at that age - is why I've long thought that 12-15 is the right age to teach assembly language. At that age, your code is going
13.
by fizbin 11y ago
It's specific to programming, but not exclusively to programming; there are a few other areas where "you haven't been doing this since you could walk? Too late to be truly good": - Mathematics (at the extreme high leve
14.
by fizbin 11y ago
Yes, it is hilarious that even compared to gold, bitcoin manages to look unstable.
15.
by fizbin 11y ago
Why on earth would they do that? Making bitcoin illegal would be the biggest action the US Government could take to get bitcoin to flourish. Right now, bitcoin is like a country with a minuscule GDP ( * ) and absolutely no currency controls
16.
by fizbin 11y ago
And looking at something already settled by the courts, it's also interesting to compare the article's chart on the legal status of interracial marriage with public opinion data: http://en.wikipedia.org/wiki/I
17.
by fizbin 11y ago
Yes, it is a really weird property of 2-spheres that that holds. One consequence is that yet another way to pick a point uniformly on the sphere is to choose z ∈ [-1, 1] uniformly, then choose λ ∈ [-180°, 180°) uniformly and use the point
18.
by fizbin 11y ago
Nor for 3-spheres (i.e. the 3-dimensional surface defined as all the points in 4-d space at distance 1 from the origin). Nor for higher dimensions than that. It's peculiar to the 2-sphere ("ordinary" spheres).
19.
by fizbin 11y ago
If you're going to use the (->) Monad instance, why not: {-# LANGUAGE MonadComprehensions #-} import Data.Maybe (fromMaybe) import Data.Monoid (mconcat) import Control.Applicative ((<*>)) pam = flip map fizzbuz
20.
by fizbin 11y ago
The ruby quiz did a round of this back after fizzbuzz had already jumped the shark the first time: http://rubyquiz.com/quiz126.html I personally thought that my two entries were pretty amusing: http://blade.naga
21.
by fizbin 11y ago
Specifically, people should note that many code generators are not carefully designed for strict reproducibility, and will stick time stamps in generated output. Even if you undo that, code generation tools are liable to at some point trave
22.
by fizbin 12y ago
I think if you want to use the appropriate analogy, you have to include that it was fundamentally a public thing to do, even though she believed her audience tiny. Your analogy as presented gets confused because of the social conventions ag
23.
by fizbin 12y ago
I don't think HN is a bunch of MRA losers, but it's certainly closely connected to places that are. (as in, lots of people participate in HN who also participate in places that could be characterized as such) So I'd say it&
24.
by fizbin 12y ago
Heh. That's my dad's quote - I remember seeing that page tacked to his office cubicle wall back in the 90s when Unisys still employed programmers who had office cubicles.
25.
by fizbin 13y ago
Its usually (in my opinion) the subject of the photograph that makes it interesting, not the style that a photographer has put on it. Have you seen this guy's shots? I've tried taking pictures of ants and other insects and it
26.
What is truth?(dtm.livejournal.com)
1 points by fizbin 13y ago|0 comments
27.
by fizbin 13y ago
The part of reading rent-a-coder that always depresses me is the rampant contract cheating. It makes me wish that by facilitating that activity and taking a piece of the action, sites like rent-a-coder incurred civil liability to the colleg
28.
by fizbin 13y ago
Rentacoder used to have a disclaimer (they may still, I haven't looked in years) that the site could not be used for any thesis or "final senior project"-type project that would determine whether or not someone received a degree. I always f