#computing #information # [[Epistemic status]] #shower-thought # Complexity >Let $T$ be a Turing machine. For each input of length $n$, if $T$ makes at most $t(n)$ moves before it stops, then we say that $T$ runs in time $t(n)$, or has time complexity $t(n)$. If $T$ uses at most $s(n)$ tape cells in above computation, then we say that $T$ uses $s(n)$ space, or has space complerity $s(n)$. >~ [[Ming Li]] Length in bits of its shortest self contained description I.e. diamond are of very low complexity, lot of repetitive pattern ([[Fractal]]?) But a hard drive is full of random bits, high complexity