A good definition is that the sparse matrix has non-zero entries proportional the number of rows. Therefore this is Big O notation less than something that has non zero entries. Of course, this only makes sense when generalizing to larger and larger matrices, otherwise we could take the constant of proportionality very high for one specific matrix.
Of course, this only makes sense when generalizing to larger and larger matrices, otherwise we could take the constant of proportionality very high for one specific matrix.
Game of chance by Ciro Santilli 37 Updated 2025-07-16
The definition is not very precise, as in many games with random elements there is a mixture of both skill and luck.
So we just use the precise Non-deterministic game term instead for any game that has any random element beyond the control of the players.
As a phisicist once amazingly put it in a talk Ciro watched:
It all depends on how much energy you have to probe nature with. Previously, we thought protons were elementary particles. But then we used more energy and found that they aren't.
If some alien race had even less energy, they might not know about electrons at all, and could think that anyons are actually elementary.
Being an "elementary particle" is always a possibly temporary label.
Jimi Hendrix by Ciro Santilli 37 Updated 2025-07-16
  • Are you experienced. OMG that album...
Physics engine by Ciro Santilli 37 Updated 2025-07-16
There is no clear distinction between "serious simulations" and "physics engines", it's just that "physics engine" have a "for video game" connotation.
And especially, in the context of gaming, it usually means "rigid body dynamics simulation" in particular.
Project-based learning by Ciro Santilli 37 Updated 2025-07-16
There is just one key gotcha: the project has to be useful.
bsdgames by Ciro Santilli 37 Updated 2025-07-16
There is great beauty here. Great beauty. It's pure terminal poetry.
The most canonical source code Ciro Santilli can find right now is: sources.debian.org/src/bsdgames/
Tree representation by Ciro Santilli 37 Updated 2025-07-16
This section is about ways in which you can represent a tree.
Trees are a specific type of graph, so any graph representation also provides a way to represent a tree.
Therefore this section will focus only on methods specific to tress, and which cannot be used for graphs in general.
Twin prime conjecture by Ciro Santilli 37 Updated 2025-07-16
Let's show them how it's done with primes + awk. Edit. They have a -d option which also shows gaps!!! Too strong:
sudo apt install bsdgames
primes -d 1 100 | awk '/\(2\)/{print $1 - 2, $1 }'
gives us the list of all twin primes up to 100:
0 2
3 5
5 7
11 13
17 19
29 31
41 43
59 61
71 73
Tested on Ubuntu 22.10.

There are unlisted articles, also show them or only show them.