A Chaitin $$\Upomega$$ number based on compressible strings.

Published in: Nat. Comput. (2012)

Keyphrases

computational complexity
small number
real time
neural network
lower bound
special case
hidden markov models
np hard
maximum number