Viewing profile — suyjuris
suyjuris
HN member- Joined
- Mon, Apr 08, 2019, 11:41 AM UTC
- HN karma
- 191
- Public activity
- 96 items
- HN profile
- View on Hacker News ↗
About suyjuris
contact@nicze.de
Recent public activity
-
comment
Comment #44492144
Yes, of course! In this case, the judge identified three separate instances of copying: (1) downloading books without authorisation to add to their internal library, (2) scanning l…
-
comment
Comment #44489979
Yes, that would by an interesting trial. But it is only about six books, and all claims regarding Claude have been dismissed already. So only the internal copies remain, and there …
-
comment
Comment #44489423
The judge appears to disagree with you on this. They found that training and selling an LLM are fair use, based on the fact that it is exceedingly transformative, and that the copy…
-
comment
Comment #44489312
Just downloading them is of course cheaper, but it is worth pointing out that, as the article states, they did also buy legitimate copies of millions of books. (This includes all t…
-
comment
Comment #44434591
Location: Munich, Germany Remote: Flexible Willing to relocate: Yes Technologies: Python, C++ Résumé/CV: https://nicze.de/philipp/cv.pdf Email: philipp.czerner@nicze.de I am curren…
-
comment
Comment #43493790
If you are caught driving above the legal limit of 0.05% you are fined roughly $570, are prohibited from driving for 1 month, and receive 2 “points”. Points accumulate and once you…
-
comment
Comment #41554668
I have a Framework 13 (AMD 7640U), running Arch Linux, and overall it is nice. It is convenient to have an HDMI port again and I did not encounter issues with hardware. (Sleep drai…
-
comment
Comment #39724144
Let us say that an index i is bad , if every finite subsequence of s starting at i is red (i.e. for every j ≥ i we have χ(s_i ... s_j) = red). Two cases: Case 1: there are infinite…
-
comment
Comment #38091098
The full decision can be found here [1]. The consumer protection agency did also seek that LinkedIn be forced to respect DNT, but the court did not grant this relief, reasoning tha…
-
comment
Comment #37795415
The name of the city is “Garching bei München” which translates to “Garching near Munich”. This disambiguates it from „Garching an der Alz“. (Although Jülich is just called Jülich.…
-
comment
Comment #37790719
I use these as well (3M Aura). They are much more comfortable than the more common types of FFP2 masks and I can wear them for prolonged periods of time without issue, but I would …
-
comment
Comment #36123974
Someone I know wanted to have a movable white rectangle on the screen to cover up things (for a presentation). They had a creative solution: open a “10h white background” video and…
-
comment
Comment #35912618
You are thinking of the union, where you can indeed just put the two NFAs “side-by-side”. This does not work for the intersection though, there you need the product construction.
-
comment
Comment #35772764
> but it's not an order of magnitude faster than any other GPU accelerated terminal It is [0,1]. Have you tried it? Up to individual preference, of course, but for me it does feel …
-
comment
Comment #35632069
> I'm going to try replacing the fan but I don't know much about electronics. Just in case: opening PSUs is dangerous without precautions. The capacitors may retain enough charge t…
-
comment
Comment #35134253
The government needs to get its money from somewhere. If it spends the taxpayers' money, that money cannot be spent on other things. So instead of doing things that are useful to s…
-
comment
Comment #34967483
It is also important to consider that better performance also increases your productivity as a developer. For example, you can use simpler algorithms, skip caching, and have faster…
-
comment
Comment #34962001
I would guess that this can work, but it seems impossible to prove. I do not have any good candidates for an NP problem that is provably harder than SAT for a deterministic Turing …
-
comment
Comment #34955226
> It is of course possible to construct a problem that will require strictly more steps than the most efficient algorithm for SAT; for example, we could give a language SAT-PRIME =…
-
comment
Comment #34389102
An easy argument why it cannot work: consider an array with 3 elements, [a,b,c]. “Shuffling” it could look as follows. Step 1. Swap a, c -> [c,b,a] Step 2. Swap b, c -> [b,c,a] Ste…
-
comment
Comment #33530854
You can compromise by using abort in debug builds and std::unreachable in release builds.
-
comment
Comment #33225250
Instant typesetting would be very welcome – I have often wished for exactly this. But I do not think that it is a technical problem. TeX is very fast, after all. (As you would expe…
-
comment
Comment #32994245
If you want to explore how BDD algorithms work visually, with animations, I did write an open-source tool for exactly this purpose a while ago: https://nicze.de/philipp/bdds/ Let m…
-
comment
Comment #32648519
You can also do it as follows: if (!(~mask & (WGPUColorWriteMask_Alpha|WGPUColorWriteMask_Blue))) { ... } Not quite as long but perhaps less readable.
-
comment
Comment #32330237
> In the German system, for instance, PhD students are paid (mind you, it's an academic salary, which is not a lot but a first year PhD student with a full time contract already ma…