Recent submissions

Comment · 4 days ago
The way it's slightly off-center is unpleasant
Comment · 4 days ago
What were the reasons to assume it would be true? I mean if you assume that NP < EXPTIME (which seems very likely) then you end up with algorithms that run in exponential time, but can't simulate turing machines with polynomial overhead. Obviously you can't simulate TMs with just anything, but most of the time... computation finds a way?
Comment · 5 days ago
There's a chain of classes P, NP(aka Sigma_1), Sigma_2, .., Sigma_n, ... PSPACE, EXPTIME. What we know for sure is that P < EXPTIME, others are unknown (well, maybe this paper adds something to this, time will tell).

It's conceivable that each of them is smaller than the next, but also that e.g. P < NP = all the sigmas < PSPACE < EXPTIME or many other possibilities. I think the general consensus is that it's more likely that there are more inequalities than not, but the fact is that we can't even show that P is less than PSPACE so far, which would be extraordinarily surprising if it were true.

Comment · 5 days ago
Not if they start making killbots.
Comment · 6 days ago
It's natively Q4.
Comment · 7 days ago
They're picking among most likely tokens, which are ones with least entropy and so least information per token.
Comment · 7 days ago
> But if the user thinks it looks fine, then won't most players think the same?

I have a suspicion that when you're looking at (and generating, because you then look at the results) AI generated images and text more you get desensitized and are more likely to say that something looks okay when to other people it won't.

Comment · 11 days ago
> nearly everyone is on the investor/owner side

I think that "everyone" needs some kind of an asterisk. Who's "everyone" in this?

Comment · 11 days ago
I don't know about other countries, but in Poland you must accept cash except for a few cases (over internet, large transactions, places without employees).
Comment · 12 days ago
I think I've seen studies that they still aren't. ICE are really (thermally) inefficient.
Comment · 14 days ago
I wonder how robust these linters are. E.g. In C you might find some library function that allocates and abuse it to get dynamic memory.
Comment · 14 days ago
It can depend on implied information, e.g. 方 can be hou or kata depending on if you're talking about about direction or a person. And that information can be before it, after it, on some image next to it, etc.
Comment · 15 days ago
> Will anyone ever be allowed to drive this on a public roadway?

I can see this being a thing in a cyberpunk dystopia, so.. in a few years I guess?

Comment · 16 days ago
If you want a function to compute BB(n) for any supplied n, then it isn't computable. But a specific number e.g. 123, BB(123) is just a number and for every integer i there is function const_i that computes i. You just will never know which f_i computes BB(123).

Live from the official Hacker News API

A modern reader for Hacker News · SvelteKit + Skeleton