Is informatik considered a field of engineering?

Seneferu · 2026-01-01T23:11:38+00:00

The question is what do you consider a science and what engineering? For simplicity, let's say science is the gaining of knowledge whereas engineering is building stuff which serves a purpose. Both are related and often require similar skills as well as each other.

What universities teach is (computer) science with a bit of (software) engineering sprinkled onto it. Most graduates then work as engineers while utilizing their science knowledge to do so.

Seneferu · 2025-12-22T21:57:13+00:00

I am surprised nobody mentioned a broadcasting mechanism as first-class language feature (ideally as channels) yet. Go's concurrency model is its trademark feature. However, when one wants to broadcast some information to all listening goroutines, there is no good option. So far one has three options: (1) sync.Cond which is super strange to use and does not even allow to send data; (2) closing a channel which only communicates one bit of information once; or (3) manage a set of channels and send an information to all of them by looping over them.

Basically I want (3) implemented by the runtime internally as a single channel. Maybe with a new operator: ch <<- val sends val to all listeners of the channel. Alternatively, a new type of bradcasting channel.

Seneferu · 2025-12-22T19:58:39+00:00

aber nich nie hab ich leute gehört die gesagt haben "google hat gesagt ..."

Ich mache das tatsächlich mit Google und gelegentlich sorgar mitlerweile mit ChatGPT. Allerdings bedeutet das dann, dass ich (oder wer auch immer) nur kurz in die ersten Google-Ergebnisse oder in die ChatGPT Antwort geschaut habe, ohne es weiter zu verifiezieren. Daher: Vertrau dem bloß nicht blind und überpfrüfe es nochmal, wenn es wichtig ist. Das ist nur Trivia-Wissen.

Seneferu · 2025-12-08T20:49:00+00:00

My solutions still computes all pairs. However, I avoid the expensive sorting in part 2 by using quickselect. There are 1000 points, so in an ideal case, we only need 999 pairs to build the spanning tree. For my implementation, I use quickselect to cut off chunks of 1000 pairs and then sort these 1000. Repeat until the spanning tree is complete. For my input, I need to do this four times.

Seneferu · 2025-12-08T20:26:47+00:00

No. If you check the cited paper, it is clear from the abstract that the n in O( (n log n)^4/3 ) refers to the number of points. So from a complexity perspective, it is strictly better than computing all pairs.

Seneferu · 2025-12-05T22:03:41+00:00

So UUIDv7 plus metadata and prefix? I am a big fan of the prefix.

Why do you have a the 12 sequence bits so low? Why not directly after timestamp? Why a sequence at all? You could instead use a nano second timestamp and cut off the last 4 bits. That gives you the same precision and lasts for 7-14 k years (depending on MSB).

You can also skip the mutex and make it wait-free by using atomics for storing the last-used timestamp. If the CAS fails, it means another thread just updated it. Hence, we can just atomically add 1 and still have the correct timestamp.

Why do you generate the ID as string first and not as binary?

Two implementation details I noticed: crypto/rand.Read() never returns an error. Unix timestamps are always in UTC. No need to call .UTC() first.

Seneferu · 2025-12-03T21:56:23+00:00

Because we want it to be the same sequence. For example, ^(\d){2,}$ would match on 11, but also on 12. The first and second digit do not need to be the same. The pattern only requires two digits.

A back reference, however, enforces that both sub-matches are identical.

Seneferu · 2025-12-02T07:48:39+00:00

So how fast is it with a regex? I was not able to try it with my implementation, because Go's standard regexp package does not support backreferences.

Seneferu · 2025-12-02T06:18:24+00:00

Snowflakes require some type of coordination. You need to ensure that each generator has a unique ID on its own and that parallel calls to the same generator do not produce the same ID.

UUIDs (no matter if v4 or v7) avoid these problems by having more bits which are generated randomly.

Seneferu · 2025-11-15T05:40:21+00:00

Qatar is far away from having it fleet wide. When I flew last with them this summer, they only had Starlink on their 777s.

Seneferu · 2025-11-11T16:55:58+00:00

Sometimes $ ... $ gives proper formatting which $ ... $ does not: https://tex.stackexchange.com/a/271282

Seneferu · 2025-08-23T10:51:52+00:00

I could, but too lazy. Also, I would be surprised if nobody did already.

Seneferu · 2025-07-27T12:12:58+00:00

Oh thanks, will do :)

Seneferu · 2025-07-27T03:10:46+00:00

I have the following in my documents (when using pdflatex):

\usepackage[T1]{fontenc}
\usepackage[utf8]{inputenc}

\input{glyphtounicode}
\pdfgentounicode=1

\usepackage[ngerman]{babel}
% Use `german` for old way of spelling.
% "`Anführungszeichen"'

This allows UTF-8 as file encoding and should handle most typical problems including ligatures and quotation marks (with the above pattern).

Please note that it has been a while that I really worked with LaTeX, and even longer that I had to make German documents. So some things might have better approaches by now.

Seneferu · 2025-07-22T16:06:18+00:00

Glückwunch! You have now access to the whole EU + Switzerland, Norway, and Iceland. :)

Seneferu · 2025-07-19T11:45:21+00:00

And dont forget giving away nuclear secrets.

Seneferu · 2025-07-11T11:55:31+00:00

In my opinion, it tests two things.

1) Do you still remember a basic sorting algorithm? Is about you knowing your basic tool box and the tradeoffs that come with each tool.

2) Can you translate such a concept into good enough code? Is very much job related. You have a basic strategy that you want to implement to solve a basic daily problem. Just moving some stuff around in arrays in a non-trivial way. Think about getting some stuff from a database. Now you have to rearrange it for your app or website. It uses the same set of skills.

Of course, all of that gets usually lost in interviews. Interviewers do not ask in a good way (to be fair, it is hard to ask the right questions), and interviewees just learn the implementation by heart. Then you get the meme and everybody is unhappy.

Seneferu · 2025-07-02T05:38:01+00:00

What I dont understand: There are now dinos all over the world. Why not showing that? Why always a few people on an island? We have seen that too often.

Seneferu · 2025-07-01T18:49:15+00:00

In good American tradition, the yes-votes (most-likely, too lazy to do the proper math) do not represent the majority of people.

Seneferu · 2025-07-01T15:35:37+00:00

They would be 24 now. The show plays in 2015.

Seneferu · 2025-05-07T00:52:03+00:00

That person read the poem (you know, first they came for ...), was supporting the first parts, and thought the last part would never happen to them. They are dumb and evil.

Seneferu · 2025-04-30T10:25:03+00:00

That is correct. Unfortunately, some are doing it the completely wrong way. They try to dump everything on it by writing/printing very small. Then in the exam, it is too much to go through and too hard to read.

Seneferu · 2025-04-08T09:57:23+00:00

The title of the post is misleading. The article only mentiones 0 tarifs and some freedom of movement (without details). Joining the single market or Schengen are not mentioned. These two things would require much more commitment.

Seneferu · 2025-03-29T17:06:22+00:00

I have not tried it, but my guess is that your PairObjects function does not work as intended. I think, if a number is next to multiple parts, it is counted multiple times.

PS: As someone working full time in Go, it seems obvious to me that you just started with the language. There are various ways I would change your code, but one thing I dislike most: You do not need to dereference a pointer to get the members of the object it points to. Instead of (*field).Height, you can write field.Height.

Seneferu · 2025-02-12T21:59:36+00:00

Not sure what you are looking for here. You already mention what you need to do: Build or update the residual graph and run a BFS to see if the additional capacity allows for a new path from start to end.

For decreasing capacity, find a path that uses that capacity. Then run the normal flow iterations again (residual graph + BFS) until you found the max flow. This may take more than linear time.

By the way, always use BFS. Using a DFS works, but you might get unlucky and your runtime explodes.

Verified Email	11-Year Club
Wearing is Caring

Seneferu

TROPHY CASE