So we see that the classification is quite simple, much like the classification of finite fields, and in strict opposition to the classification of finite simple groups (not to mention the 2023 lack of classification for non simple finite groups!)
Ciro Santilli invented this term, it refers to mechanisms in which you put an animal in a virtual world that the animal can control, and where you can measure the animal's outputs.
- MouseGoggles www.researchsquare.com/article/rs-3301474/v1 | twitter.com/hongyu_chang/status/1704910865583993236
- Fruit fly setup from Penn State: scitechdaily.com/secrets-of-fly-vision-for-rapid-flight-control-and-staggeringly-fast-reaction-speed/
Symmetry breaking in superconductors by 
Ciro Santilli 37 Updated 2025-06-02 +Created 1970-01-01
Ciro Santilli 37 Updated 2025-06-02 +Created 1970-01-01As mentioned in True Genius: The Life and Science of John Bardeen page 224, the idea of symmetry breaking was a major motivation in Josephson's study of the Josephson effect.
Ubuntu 23.04 install:
sudo apt install rbaseHello world:
R -e 'print("hello world")'Course plan:
- Section "Programmer's model of quantum computers"
- look at a Qiskit hello world
- e.g. ours: qiskit/hello.py
- learn about quantum circuits.
- tensor product in quantum computing
- First we learn some quantum logic gates. This shows an alternative, and extremely important view of a quantum computer besides a matrix multiplication: as a circuit. Fundamental subsections:
- quantum algorithms
We ust use the if mod notation definition as mentioned at: math.stackexchange.com/questions/4305972/what-exactly-is-a-collatz-like-problem/4773230#4773230
The Busy Beaver Competition: a historical survey by Pascal Michel by Ciro Santilli 37 Updated 2025-06-02 +Created 1970-01-01
Ciro Santilli 37 Updated 2025-06-02 +Created 1970-01-01These appear to be benchmarks that don't involve running anything concretely, just compiling and likely then counting gates:
Quantum circuit description language by Ciro Santilli 37 Updated 2025-06-02 +Created 1970-01-01
Ciro Santilli 37 Updated 2025-06-02 +Created 1970-01-01One would hope that they are not Turing complete, this way they may serve as a way to pass on data in such a way that the receiver knows they will only be doing so much computation in advance to unpack the circuit. So it would be like JSON is for JavaScript.
E.g. with our qiskit/hello.py, we obtain the Bell state circuit:
OPENQASM 2.0;
include "qelib1.inc";
qreg q[2];
creg c[2];
h q[0];
cx q[0],q[1];
measure q[0] -> c[0];
measure q[1] -> c[1];
Turing machine regex tape notation is Ciro Santilli's made up name for the notation used e.g. at:Most of it is just regular regular expression notation, with a few differences:
- denotes the right or left edge of the (zero initialized) tape. It is often omitted as we always just assume it is always present on both sides of every regex
A,B,C,DandEdenotes the current machine state. This is especially common notation in the context of the BB(5) problem<and>next to the state indicate if the head is on top of the left or right element. E.g.:indicates that the head11 (01)^n <A 00 (0011)^{n+2}Ais on top of the last1of the last sequence of n01s to the left of the head.
This notation is very useful, as it helps compress long repeated sequences of Turing machine tape and extract higher level patterns from them, which is how you go about understanding a Turing machine in order to apply Turing machine acceleration.
Unlisted articles are being shown, click here to show only listed articles.