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