Matrix multiplication example.
Fundamental since deep learning is mostly matrix multiplication.
Contains several computer vision models, e.g. ResNet, all of them including pre-trained versions on some dataset, which is quite sweet.
Documentation: pytorch.org/vision/stable/index.html
Organization developing quantum dot quantum computer by 
Ciro Santilli 37 Updated 2025-07-01 +Created 1970-01-01
Ciro Santilli 37 Updated 2025-07-01 +Created 1970-01-01catalog.ngc.nvidia.com/orgs/nvidia/resources/resnet_50_v1_5_for_pytorch explains:
The difference between v1 and v1.5 is that, in the bottleneck blocks which requires downsampling, v1 has stride = 2 in the first 1x1 convolution, whereas v1.5 has stride = 2 in the 3x3 convolution.This difference makes ResNet50 v1.5 slightly more accurate (~0.5% top1) than v1, but comes with a small performance drawback (~5% imgs/sec).
Best busy beaver machine known since 1989 as of 2023, before a full proof of all 5 state machines had been carried out.
Paper extracted to HTML by Heiner Marxen: turbotm.de/~heiner/BB/mabu90.html
Turing machine that halts if and only if the Goldbach conjecture is false by Ciro Santilli 37 Updated 2025-07-01 +Created 1970-01-01
Ciro Santilli 37 Updated 2025-07-01 +Created 1970-01-01 Turing machine that halts if and only if Collatz conjecture is false by Ciro Santilli 37 Updated 2025-07-01 +Created 1970-01-01
Ciro Santilli 37 Updated 2025-07-01 +Created 1970-01-01mathoverflow.net/questions/309044/is-there-a-known-turing-machine-which-halts-if-and-only-if-the-collatz-conjectur suggests one does not exist. Amazing.
Intuitively we see that the situation is fundamentally different from the Turing machine that halts if and only if the Goldbach conjecture is false because for Collatz the counter example must go off into infinity, while in Goldbach conjecture we can finitely check any failures.
Amazing.
Condensed matter physics course of the University of Oxford by Ciro Santilli 37 Updated 2025-07-01 +Created 1970-01-01
Ciro Santilli 37 Updated 2025-07-01 +Created 1970-01-01Non formal proof with a program March 2023: www.sligocki.com/2023/03/13/skelet-1-infinite.html Awesome article that describes the proof procedure.
The proof uses Turing machine acceleration to show that Skelet machine #1 is a Translated cycler Turing machine with humongous cycle paramters:
There are unlisted articles, also show them or only show them.