Viewing profile — daveFNbuck

The complaint here is about this being an insufficient amount of effort because the bibtex entry from Google Scholar is wrong sometimes.

You want the content of the paper to be carefully crafted. Bibtex entries are the sort of thing you want people to copy and paste from a trusted source, as they can be difficult to…

steel-man means trying to interpret someone's argument in the most favorable light rather than arguing against a weaker interpretation. It does not mean making up a different argum…

Spending money to ensure something is released online for free is not the opposite of thinking it should be released online for free though. If think the owner should give up its m…

If you think this is more important than the money it can be sold for, you should be the one to buy it.

That's not p hacking. That's just the nature of p values. P hacking is when you do things to make a particular experiment more likely to show as a success.

Why do you think senior managers would replace themselves if they could? Given the choice between saving a company and giving a senior manager slightly more money or power, the sen…

Can you explain the difference?

If you do that, people outside the package can also do Username(x) conversions instead of calling NewUsername. Making value package private means that you can only set it from outs…

We're at single digit gigahertz for an entire chip, not a single transistor.

I don't think most people make a special trip just to get gas. It's usually a quick added stop along the way of another trip, which is less of a nuisance than having to make two sm…

They happen more than once. You'd change your bid for the aggregate effect of paying for many wins, not for an individual auction.

They show the DFA for it on the site, it's 3 states. There's a starting state for the first . and then two states that transition back and forth between whether z was the last char…

Having a constant runtime means there's a constant bound on the runtime, not that the runtime is an exact constant value. 100 + 1/n would still be constant, as it's bounded above a…

An algorithm can't have that property for its expected runtime, as it can only look at a sub-constant amount of the input of it runs in sub-constant time. it's not possible for it …

That's what I'm saying. The runtime will go down to a constant. It can't keep decreasing forever.

I'm not sure what your big-O expression is supposed to mean, but if a sequence is decreasing and bounded below (which runtime is) then it has a limit. Since the sequence is discret…

> Running any (halting) algorithm on a human computer is constant time, because you're bound by the number of states you can fit into some terabytes, but nobody should actually try…

"constant time" in complexity theory just means there's a constant bound on runtime. It doesn't have to actually have the exact same runtime down to the instruction for every input…

You can't have that because when N=K that's not a valid expression and when N>K you're putting a negative number in the big-O notation. You can't have negative runtime. All algorit…

With probabilistic algorithms, you still have the fundamental limitation that there's a lower-bound to how fast an algorithm can run. You can't keep getting faster indefinitely.

> Edit: it is trivial to construct an algorithm with this property. It's actually impossible to construct an algorithm that has its runtime decrease as the input size grows. You ca…

With probability 1 as time goes to infinity.