FishFace

can you only pee if there are no balls?? I am confused

That is an absolute himbo top he’s wearing and I never really registered it before.

Did the surgery relocate your glans somewhere to enable that or is that just the way it be?

You ask too much.

Sleep on Linux is never quite as reliable as it should be, and I end up with a laptop gently roasting itself to death in my bag more times than I’d prefer.

Not yet…

Well you certainly aren’t giving me any reason to agree… :/

The objective reality of an AI hallucination being wrong is not what’s important though; what is important is the effect it has on people, which will in part be subjective.

Nothing prevents you from comparing harms and ease of checking.

It’s comparable because it’s a negative outcome that may cost something (cooking a new meal, ordering a takeaway) to fix, but can be checked quite easily. Information that is factually incorrect has a negative outcome as well, and can also be checked quite easily - but the negative outcome, and the ease of checking, varies vastly across the space of all possible information.

I am encouraging you to think about situations where the negative outcome is not that bad, and the ease of checking quite high. Does that make using AI more practical?

If you are using the bot just to perform things that you could easily look up, then yes, that is pointless.

If you can’t know if it’s right or wrong, and have to double check it, why use it in the first place?

Me and my partner alternate doing the cooking. She doesn’t know if I’m going to make a mistake and serve her something she doesn’t like (it has happened). Does that mean she’s better off doing all the cooking herself?

“If it’s not perfect, it’s useless” is a fallacy. So the question is, how good does it have to be to be useful? That depends on the task, and especially on the cost (however you measure it - dollars or hours or whatever) of verifying whether the result is good compare to the cost of a person doing the task.

That’s for laptop keyboards - I don’t see any spare parts there for membrane keyboards. I said “rubber dome” but I guess that was ambiguous; I meant the PC keyboards where there’s a single moulded rubber sheet inside that forms the switch and “spring”. I was not able to quickly find anywhere offering spare membranes for ordinary keyboards, but I’m pretty sure they’ll be more than 5 euro :P

A keycap is that? I don’t believe that is how rubber dome keyboards break… I think the rubber sheet degrades so that it no longer closes the switch when pressed, and you need to open up the whole thing, clean it, and replace the whole sheet (which is custom for each board, not as generic as a switch) if you can find one.

Most keyboards (not in laptops) are rubber dome ones though… Significantly less economical to repair.

It’s a joke.

My friend used to have a pc in a cardboard box, but it had a separate monitor. Also you had to turn it on twice; the first time it would crash…

#fuckthecolourblind

All animals are producing heat by metabolism, and so are naturally hotter than their environments. Being in an environment that is as hot as your ideal body temperature means your metabolism raises your temperature above the ideal.

The only way around this is active cooling - like sweating - which is generally uncomfortable as a signal that you are expending energy on keeping cool and try and get somewhere cooler where you won’t have to expend as much energy on that.

Well I just had to work it out again myself and you’re right. I dunno what scenario I was thinking of that had worse complexity and whether it was really due to dynamic arrays; I just remember getting asked about it in some interview and somehow the answer ended up being “use a linked list and the time complexity goes down to linear” /shrug

Thanks for the correction!

Yes, but dynamic resize typically means copying all of the old data to the new destination, whereas a linked list does not need to do this. The time complexity of reading a large quantity of data into a linked list is O(N), but reading it into an array can end up being O(N^2) or at best O(N log N).

You can make the things in your list big chunks so that you don’t pay much penalty on cache performance.

I thought of another good example situation: a text buffer for an editor. If you use an array, then on large documents inserting a character at the beginning of the document requires you to rewrite the rest of the array, every single character, to move everything up. If you use a linked list of chunks, you can cap the amount of rewriting you need to do at the size of a single chunk.

What would you use if you don’t know how much space you were going to need in advance, and you were gonna only read the data once for every time the structure got created.