> A perceptron *is* the smallest brain you can build.

> In 1958, a researcher named Frank Rosenblatt built a machine *he called* the perceptron.

> It was *inspired* by a single brain cell, a neuron.

I did a lecture once which included a 5 minute whirlwind tour of neural net history.

I included a remark about how time travellers would find Rosenblatt a better target than Miles Dyson.

I was never quite sure on how close, or over, the line that was on appropriateness. It was definitely thought provoking.

Yes . But at least the post seems to be written by OP himself!

and its an a great learning resource - which is arguably more important :-)

> I'm not sure about whether this is a bottlenecking step in applications

In barrier method of solving linear programs, numeric factorization normally takes about 1/3 of the time of main loop (like after all symbolic/presolve steps).

> That is, is there a (sparse) matrix representation which is used in gpu's?

We (COPT) did manage to write a gpu version of Cholesky factorization, and it's faster than our (pretty fast) cpu implementation. Although one can argue that the CPUs for benchmarking is not the fastest, or it is not as expensive as the GPUs.

Currently our barrier implementation is 67% faster on H200 than on i7-11700K [1]. Not all of the improvement contributes to Cholesky factorization.

Another GPU Cholesky factorization implementation we are aware of is CUDSS by nvidia.

> And does it make sense to carry through the dag/tree construction as a sort of "prep" step (on cpu or gpu)?

For both CPU and GPU version, a symbolic phase is necessary, as we usually expect many factorizations on matrices with the same sparse pattern. CUDSS has (at least some part of) their symbolic phase on GPU.

[1] https://plato.asu.edu/ftp/lpfeas.html

> The toilet also features a rotating heating element that evaporates urine and dries other waste.

Electrical cars got exhaust gas now, in a worse way.

> a block of Rust threads that are properly programmed to take advantage of the vector processing by avoiding divergence

But the library is using a warp as a single thread

You didn't explain or prove there is a reason for it.

My car is 605km in CLTC and 492km in WLTP. And it runs for about 450km before battery totally die, so I have to charge for every about 400~420km. A bit cold and totally no hill here in Shanghai.

So for 900km CLTC, I think it will go like at least 600~650km easily.

I like the fact that the photos seem to be real rather than simulated.

Yeah, with all these colors, any single character should be enough.

Look at "Four Asian Tigers", people don't just constantly become rich for granted

I thought no guessing mode means the map is generated in such way that guessing is not needed to solve the whole board? (To those who didn't know the mode, it also forces you a starting point)

As an experiment, I tried clicking on a random position after clicking the starting point. And it is possible to that the position is safe. So I don't think the map in no guessing mode is dynamic.

Also in the help section: "In this mode, a starting position is provided, and you never need to guess to complete the board."