129 karma · joined June 3, 2012
I shouldn't have left all my Blender books on the bottom shelf of the bookcase where my old cat could pee on them. I need to pick it back up again. Good thing there are so many more resources these days.
I heard from a friend at the time that Tixati was another decent BT client.
And for Python development, a Vagrant installation works wonders, as does PyCharm, which I was telling to shut up and take my money after 3 minutes.
Of course, if I were, I probably couldn't comprehend the thought in the first place, so rationally, I know I'm not. A lot of it probably comes from reading things from/about people infinitely smarter/more motivated than I am, and feeling like I have no idea what I'm doing.
The random number generator must have been racist against me specifically. Yeah, that's the ticket.
"You are now one out of 421,843 eligible beta candidates."
It's been at that number since the registration ended, and I'm almost certain it's worldwide, since they didn't say U.S.-only until today.
I like my odds.
DM has a reputation on here as some sort of shitty content farm, but that's just a fraction of what we do. Maybe that's just the only part of the business the markets care about.
At least for my group, sales rings the dinner bell announcing a new contract frequently enough that it's driving engineering insane. They need to move that damn thing over by marketing.
Regardless of whether polyphasic is best, it looks like it also supports biphasic and a variety of other sleep modes.
I'm guessing Austin, and either Guadalupe, Koenig, or Manchaca (or all three) for the street.
The current largest prime is (2^57885161)-1, which is 17,425,170 digits, yet can be represented with much less, obviously.
Maybe adding exponents would help. aX^n + b, perhaps?
With really, really huge (like the aforementioned 7GB) numbers, you might see something better, sort of how there's a point with most compression methods that the header is bigger than the data being compressed.
Kinda doubting it now, though.
I'm assuming the known primes would be in a database somewhere, and you could just use the indices, instead of some 512-digit number.
The process could be repeatable if 'a' was too big, theoretically enabling some extreme compression.
You'd need a way to handle extremely large ints, and in the few minutes I thought about it, you'd need at least twice the original file size available for compression/decompression.
I'm also pretty sure my idea is full of shit, but there are more details than in the article.
I do love the format, but what I like a bit better about Clojure Koans is that you can see the previous ones for a bit of a reminder.
Maybe for each section, they could leave up the ones you'd successfully completed so you could refer to them.
Other than that minor nitpick, I love this.
Mark Cuban is out.
I was so damn excited for about 3 minutes until I compared the dates on the lottery site.
On the plus side, I think they're going to use my team's Hackathon project on eHow to replace all the irrelevant remnant ads with relevant, related ones, and clean it up a bit.
Looks like that was in early 2011, before Panda came and nearly wiped eHow out, and over a year before I started. After that, they made a concerted effort to fix their algorithms and focus on providing good, non-automated content. Are they still considered a content farm to be avoided these days?