HackerTrans
トップ新着トレンドコメント過去質問紹介求人

elcomet

no profile record

投稿

What does a lean proof prove?

supaiku.com
5 ポイント·投稿者 elcomet·7 か月前·1 コメント

コメント

elcomet
·先月·議論
UUID as key is useful when you have a distributed system where multiple workers create items independently
elcomet
·4 か月前·議論
Could you share your config?
elcomet
·8 か月前·議論
The heat pump will pull heat from inside the house? This sounds terrible for efficiency in winter, as you will need to reheat the room
elcomet
·8 か月前·議論
Yeah this sounds disingenuous. I can also see my heater to 70C if I want, that does not increase its size...
elcomet
·9 か月前·議論
I don't understand all the hype for generating SVG with LLM. The task is not really useful, doesn't seem that interesting in single shot as it's really hard, and no human could do it (it would be more useful if the model has visual feedback and could correct the result).

And also, since it becomes a popular task, companies will add the examples in their training set, so you're just benchmarking who has the better text to SVG training set, not the overall quality of the model.
elcomet
·9 か月前·議論
I'd say that thoughts and reasoning are two different things, you're moving the goalpost.

But what makes the computer hardware fundamentally incompatible with thinking? Compared to a brain
elcomet
·9 か月前·議論
How can you know?
elcomet
·9 か月前·議論
Can you explain more? Which things are impossible in blender
elcomet
·昨年·議論
Arc browser unifies the tabs and bookmarks in a very clever way.
elcomet
·昨年·議論
If it's chromium based, they will need to remove manifest v2 at some point to stay close to the upstream version.
elcomet
·3 年前·議論
There are many more things called lora.

https://en.m.wikipedia.org/wiki/Lora

It doesn't really matter as long as it's not in the same field. No one will be confused between the two.
elcomet
·5 年前·議論
You're right, sorry about the lack of precision
elcomet
·5 年前·議論
Turing completeness refers to a language, while NP-completeness refers to an optimization problem.

So for it to be turing complete you first need to define a language based on tetris. For NP-completeness, it might just be solving the game.
elcomet
·6 年前·議論
Do you have big bills for traffic?
elcomet
·7 年前·議論
I think the answer is in your question:

Why would search history be related to travel history? Can't they be decoupled?