Waiting Skeleton

encoding function 𝑓:𝑀→⟨𝑀⟩
f
:
M
→
⟨
M
⟩
, that maps a Turing machine 𝑀
M
to a bitstring ⟨𝑀⟩
⟨
M
⟩
. The KSC-complexity of a (bit)string 𝑠
s
that is input into 𝑀
M
is given by;

𝐾(𝑠)=min𝑑ℒ(𝑠)Len[𝑑ℒ(𝑠)](1) (1) K(s)=
min
d
L
(
s
)
Len
[
d
L
(
s
)
]


where