On characterizations of randomized computation using plain Kolmogorov complexity1
Keyword(s):
Keyword(s):
1988 ◽
Vol 64
(4)
◽
pp. 115-118
Keyword(s):
1988 ◽
Vol 64
(5)
◽
pp. 155-158