a1k0n

22 ms·

181.
by a1k0n 14y ago
The Shannon limit would be at most 2Gbps...
182.
by a1k0n 14y ago
One of the links goes to an earlier APOD from 2007 of other holes in Mars: http://apod.nasa.gov/apod/ap070528.html
183.
by a1k0n 14y ago
That may all be true, but in my experience working at a very large webmail provider, the vast, vast majority of phishing attempts (not just 419 scams, but also really terrible attempts to get passwords to email accounts from which to launch
184.
by a1k0n 14y ago
A pendant is something that hangs from a necklace. A pedant is someone who points that out.
185.
by a1k0n 14y ago
Nice. The protocol is completely insecure and the server trusts everything the client does, so "Joshua" is just getting all the food every turn (by sending "eaten-snack" messages) and drawing random stuff. The client should only be able to
186.
by a1k0n 14y ago
So when I upload a bot now, I get a 504 gateway timeout, but it does eventually seem to work. But then my games played resets to 88 instead of 0.
187.
by a1k0n 14y ago
I can't delete my old bot, and my new bot is compiling indefinitely.
188.
by a1k0n 14y ago
I also think your alpha-beta bot is objectively better than the (currently) #1 bot. Easiest thing to throw together now is a script which just feeds the whole game history into bayeselo as a bunch of fake chess matches, with the white move
189.
by a1k0n 14y ago
You may need to consider a better way to rank players - percentage of games won is problematic (as was discovered during the Tron Google AI challenge) and something like TrueSkill or bayeselo would be more robust.
190.
by a1k0n 15y ago
It seems to work just fine. The local prediction looks kind of ugly with colorcolumn enabled, though, since it assumes characters are being inserted when doing local prediction, which shifts the colored column right for each keystroke unti
191.
by a1k0n 15y ago
Ah-ha, yes there is. Sorry.
192.
by a1k0n 15y ago
I think your lit table also implies you can write to literals. So I can 'SET 2, 0x1f; SET A, 2' and now A is 0x1f.
193.
by a1k0n 15y ago
Oh yeah. 0xB8000. (You'd use a segmented address of 0xB800:0000, but the "segment" part that would be in 16-byte "paragraphs", so the logical "flat" address was equivalent to 0xB8000).
194.
by a1k0n 15y ago
I think Notch is thinking the same thing: https://twitter.com/#!/notch/statuses/184933588754628609 I'm guessing it's 80x25, 2000 words starting at 0x8000, high byte is the attribute and low byte is the character. Just like a CGA/EGA/VGA
195.
by a1k0n 15y ago
And I'm pretty sure the O register isn't supposed to be set in all cases. And what was lit[] supposed to be for?
196.
by a1k0n 15y ago
That's why it's called 0x10^c. And the 16-bit CPU supports extended addition and multiplication via ADD/ADC and MUL, so it's easy.
197.
by a1k0n 15y ago
More like a massively multiplayer programming competition. I'm doomed.
198.
by a1k0n 15y ago
I want to second MacKay's book. I had a terrible statistics class in college. We spent the entire time looking up tables of p-values and t tests, without a very convincing explanation as to why. The entire topic was damaged for me from t
199.
by a1k0n 15y ago
I haven't investigated it in depth -- quadrature over a single variable as this is can be pretty quick to compute. Not sure how scipy does it. Anyway, I personally think 95% confidence intervals are a crutch. The correct Bayesian approa
200.
by a1k0n 15y ago
There are a lot of comments complaining about how complicated the math is. This shouldn't be all that hard to understand. The assumption is that there's some constant p underlying probability that a random person will rate a given thing
201.
by a1k0n 15y ago
Ah, ok. So is this a sort of Markov model, where you are predicting the probability of getting an exercise right after observing (some subset of) the previous exercises? And E is not 1 or 0, but the expected probability of getting it righ
202.
by a1k0n 15y ago
Isn't the coefficient on 'T', the predicted 'mastery' variable, pointing the wrong way in the final logistic regression? And 'E', which is just getting 85% of the exercises right, is completely dominating all the other stuff (exponential m
203.
by a1k0n 15y ago
So, is there anyone actually against this change?
204.
by a1k0n 15y ago
I'm actually curious about that distribution; could you gain compression efficiency by grouping them into 3-base-pair codons? Or is DNA pretty much random at the base-pair level and the codon redundancy makes it actually work anyway?
205.
by a1k0n 15y ago
Well, we wanted to add some "life" to the universe with some automated trade convoys and so forth, and I had the crazy idea to use a rule-based system to implement it, and found an off-the-shelf clone of CLIPS (the expert system type thing)
206.
by a1k0n 15y ago
It does seem to have restarted recently, so perhaps it is auto-restarting. It takes a few minutes, though.
207.
by a1k0n 15y ago
And really not all that interesting. Weird. Hi, HN. Also, we ended up ditching Lisp. Goofing around in Lisp when we had no idea how to deploy it wasn't really a smart move for a four-man startup, in retrospect.
208.
by a1k0n 15y ago
Update: they helped a brother out, and the stack is actually executable on those binaries. I found out after mailing the organizers in exasperation. I was under this impression because newly-compiled binaries had no-exec on the stack, and
209.
by a1k0n 15y ago
ASLR and non-executable stack make level 4 a huge pain in the ass. (But it's not me doing that)
210.
by a1k0n 15y ago
So that that block only executes once, right after the transition to 2000. Why -1 as opposed to some other true value? Beats me.

More ›