raluk

At first glance looks like stipped C++ with minor differences. For example go have row polimorphism compared to OOP in C++. What else is there that C++ does not have?

In similar fashon in year 2009 Amazon deleted books from Kindle. One of them was 1984 from George Orwell.

This algebra is also called bicyclic semigroup https://en.wikipedia.org/wiki/Bicyclic_semigroup

In C / C++ there are two kinds of undefined behaviour. One is where there is written in standard what UB is. Another one is everthing else that is not in standard.

Spending few weeks trying to understand Kalman filterm, I figured out that I need to understand all if the following:

1. Model of system

2. Internal state

3. How is optimal estimation defined

4. Covariance (statistics)

Kalman filter is optimal estimation of internal state and covariance of system based on measurements so far.

Kalman process/filter is mathematical solution to this problem as the system is evolving based on input and observable measurements. Turns out that internal state that includes both estimated value and covariance is all that is needed to fully capture internal state for such model.

It is important to undrstand, that having different model for what is optimum, uncertenty or system model, compared to what Rudolf Kalman presented, gives just different mathematical solution for this problem. Examples of different optimal solutions for different estimation models are nonlinear Kalman filters and Wiener filter.

---

I think that book on this topic from author Alex Becker is great and possibly best introduction into this topic. It has lot of examples and builds requred intuition really well. All I was missing is little more emphasis into mathematical rigor and chapter about LQG regulator, but you can find both of this in original paper by Rudolf Kalman.

It improves immune system and geneal wellbeing. It is pain that you can get used to and I kind of enyoj it now in some weird way. It is hard, requires some dedication and brings some benefits, but does not requre extra time or planning. Great morale booster.

Over the hollidays I was working on Steve Balmers interview puzzle. https://rahne.si/optimisation/2026/01/07/steve-ballmer-inter...

What I am most proud of is that I got the solution in the corse of apporx 1 week working on this!

Using only cold water for showers.

What are protental issues with compiler, by just disabling borrow checker? If I recall correctly some compiler optimisations for rust can not be done in C/C++ because of restrictions implied by borrow checker.

"Math nerd explains how to spend 3 days proving 1+1=2" -> Original "From Zero to QED: An informal introduction to formality with Lean 4" https://news.ycombinator.com/item?id=46259343

Years ago I wrote c++ library for stream compostion. Something like C++20 ranges. It turns out that as long as you compose everything with lambdas, compiled code is same as it would be with naive loops. Everything gets optimised.

For example, you can write sum of numbers less than n as:

  count(uint64_t(0)) 
   | take(n) 
   | sum<uint64_t>();

How much is fft used for AI? Seems that attention and convolution could benefit from this.

Having lexicial scope it is same as -> defer fn{if(some condition) x() }() within scope.

Given that you die, when one vital organ dies it will eventaully hapen in this way or another. I read somwhere and that stuck in my brain, that maxmimal logevity for humans is estimated to be approximetly 125 years.

This is what i hand in mind whit "manually handing of futures". In this case you have to write

   Promise1 = f1(); Promise2 = f2();
   v1,v2 = await Join(Promise1, Promise2);
   return v1 + v2

On the other hand, it is necessary becase some of underlying async calls can be order dependend.

for example

    await sock.rec(1) == 'A' && await sock.rec(1) == 'B'

In there is also ApplicativeDo that works nicely with this.

    do 
      x <- f1
      y <- f2
      return $ x + y

One thing that most languages are lacking is expressing lazy return values. -> await f1() + await f2() and to express this concurently requres manually handing of futures.

Great exercise driven course is: https://github.com/system-f/lets-lens

https://blog.jle.im/entry/lenses-products-prisms-sums.html

Our team is working with soniox.com They are the most acurate model that works real time.

One problem with fast writing is that it requres more energy to transmit from reader to a card in order for a card that has no internal source of power, to toggle bits. It is harder compared to just reading a bit from a card. Additonaly it is tricky to implement trasaction with single write, given that data transfer can be interrupted (for example user removes card from RF field). I am not sure if single write is enough for making this robust/transactional. It also helps a lot if RFID antenna is well tuned. Proximity of metal and way it is mounted has a big impact, so it is important that RF antenna for reader is tuned for exact environment it is mounted in.

How one writes circular circuit, for example stream of fibonnachi numbers or IIR filter? For IIR filter it would be nice if it has protoype like iir(sig : T, a : vec<T, N>, b : vec<T,M>) -> T

For low level benchmarking papi https://icl.utk.edu/papi/ is great tool. It provides access for counters like cache misses, branch misses and number of cycles.

I learned programming using mIRC scripting. There used to be bunch of quiz chaneles about trivia. I logged channel to collect questions and then wrote script that provided response after some time based on linear function k + n*len(response). That was my fist piece of software I wrote. mirc scrpting based on event system was super nice system to work with. Later I also wrote chat bot and i collected have some funny conversations with strangers.

Websocket is not ment to be sent as streams (TCP equvalent), but as datagrams aka packets (UDP equivalents). Correct me if I am wrong, but websockets api in Javascript libraray for browsers is pretty poor and does not have ability to handle backpressure and I am sure it can not handle all possible errors (assertions about delivery). If you want to use websockets as TCP streams including seasson handling, great care should be taken as this is not natively availabe in neither rfc6455 and in browser.

Paying subscribers are the best customers to advertise to.

Extra. I am not sure if that is clear from paper, but in example of 1.75 * 2.5 we can represent 1.75 also as (1-0.125) * 2. This gives good aproximations for numbers that are close but less than power of 2. This way abs(a*b) in (1+a)*(1+b) is allways small and strictly less than 0.25.

Another example, if we have for example 1.9 * 1.9 then we need to account for overflow in (0.9 + 0.9) and this seems to induce similar overhead as expressing numbers as (1-0.05)*2 .

Your kernel seems to be incorrect for 1.75 * 2.5. From paper we have 1.75 == (1+0.75)*2^0 for 2.5 == (1+0.25)*2^1 so result is (1+0.75+0.25+2^-4)*2^1 == 4.125 (correct result is 4.375)

RAII

California will not abandon its responsibility.