Regular polytope Updated +Created
TODO understand and explain definition.
Turing machine Updated +Created
The dominating model of a computer.
The model is extremely simple, but has been proven to be able to solve all the problems that any reasonable computer model can solve, thus its adoption as the "default model".
The smallest known Turing machine that cannot be proven to halt or not as of 2019 is 7,918-states: www.scottaaronson.com/blog/?p=2725. Shtetl-Optimized by Scott Aaronson is just the best website.
A bunch of non-reasonable-looking computers have also been proven to be Turing complete for fun, e.g. Magic: The Gathering.
Formal language theory Updated +Created
Intermetallic Updated +Created
Search engine Updated +Created
Unicode Updated +Created
1952 Nobel Prize in Chemistry Updated +Created
Organic compound Updated +Created
Pauli gate Updated +Created
Poison Updated +Created
Simply connected space Updated +Created
Continuity equation Updated +Created
FreeFem examples Updated +Created
Synapsid subclade Updated +Created
Union (set theory) Updated +Created
Green's function Updated +Created
Point-to-point construction Updated +Created
Solder Updated +Created
Tim O'Reilly Updated +Created
3D rigid body dynamics Updated +Created

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