One of the most simple to state undecidable problems.
The reason that it is undecidable is that you can repeat each matrix any number of times, so there isn't a finite number of possibilities to check.
This is a good and simple first example of Lie algebra to look into.
This is a way to host a server that actually hide the IP of the server from the client, just like Tor hides the IP of the client from the server. Amazing tecnology!
This is why it enables hosting illegal things like the Silk Road: law enforcement is not able find where the server is hosted, and take it down or identify the owner.
I guess you also have to change the sign of the gravitational constant?
What happens to the definition of the orthogonal group if we choose other types of symmetric bilinear forms by Ciro Santilli 35 Updated 2025-01-10 +Created 1970-01-01
We looking at the definition the orthogonal group is the group of all matrices that preserve the dot product, we notice that the dot product is one example of positive definite symmetric bilinear form, which in turn can also be represented by a matrix as shown at: Section "Matrix representation of a symmetric bilinear form".
By looking at this more general point of view, we could ask ourselves what happens to the group if instead of the dot product we took a more general bilinear form, e.g.:The answers to those questions are given by the Sylvester's law of inertia at Section "All indefinite orthogonal groups of matrices of equal metric signature are isomorphic".
- : another positive definite symmetric bilinear form such as ?
- what if we drop the positive definite requirement, e.g. ?
The only perfect cryptosystem!
The problem is that you need a shared key as large as the message.
Systems like advanced Encryption Standard allow us to encrypt things larger than the key, but the tradeoff is that they could be possibly broken, as don't have any provably secure symmetric-key algorithms as of 2020.
OMG, the second half of the game where the world becomes quite open and all backstories are revealed, is one of the best gaming moments ever.
Two parallel Josephson junctions.
In Ciro's ASCII art circuit diagram notation:
|
+-+-+
| |
X X
| |
+-+-+
|
Man-made virus!
TODO: if we had cheap de novo DNA synthesis, how hard would it be to bootstrap a virus culture from that? github.com/cirosantilli/cirosantilli.github.io/issues/60
Is it easy to transfect a cell with the synthesized DNA, and get it to generate full infectious viral particles?
If so, then de novo DNA synthesis would be very similar to 3D printed guns: en.wikipedia.org/wiki/3D_printed_firearms.
It might already be possible to order dissimulated sequences online:
This equation is a subcase of Equation "Schrödinger equation for a one dimensional particle" with .
We get the time-independent Schrödinger equation by substituting this into Equation "time-independent Schrödinger equation for a one dimensional particle":
Now, there are two ways to go about this.
The first is the stupid "here's a guess" + "hey this family of solutions forms a complete basis"! This is exactly how we solved the problem at Section "Solving partial differential equations with the Fourier series", except that now the complete basis are the Hermite functions.
The second is the much celebrated ladder operator method.
Dirac equation solution for the hydrogen atom by Ciro Santilli 35 Updated 2025-01-10 +Created 1970-01-01
Synchronous dynamic random-access memory by Ciro Santilli 35 Updated 2025-01-10 +Created 1970-01-01
There are unlisted articles, also show them or only show them.