ConceptPhysics
Levin's time-bounded complexity
The minimum over programs printing n of the program length plus the logarithm of its runtime.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.